Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Graph reduction

Known as: Combinator graph reduction, Reduction 
In computer science, graph reduction implements an efficient version of non-strict evaluation, an evaluation strategy where the arguments to a… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2016
Highly Cited
2016
Multiscale transforms designed to process analog and discrete-time signals and images cannot be directly applied to analyze high… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2014
Highly Cited
2014
Computational and memory costs restrict spectral techniques to rather small graphs, which is a serious limitation especially in… Expand
  • figure 1
  • figure 3
  • figure 2
  • table 1
  • figure 4
Is this relevant?
Highly Cited
2012
Highly Cited
2012
One of the important Natural Language Processing applications is Text Summarization, which helps users to manage the vast amount… Expand
  • figure 1
  • figure 2
  • figure 4
  • figure 5
  • figure 7
Is this relevant?
Highly Cited
2011
Highly Cited
2011
We present a novel approach to graph partitioning based on the notion of \emph{natural cuts}. Our algorithm, called PUNCH, has… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2002
Highly Cited
2002
Motivated by applications to proof assistants based on dependent types, we develop and prove correct a strong reducer and… Expand
  • figure 1
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2001
Highly Cited
2001
This paper presents a number of new ideas and results on graph reduction applied to graphs of bounded treewidth. S. Arnborg, B… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 5
  • figure 6
Is this relevant?
Highly Cited
2000
Highly Cited
2000
The foundation of a process model lies in its structural specifications. Using a generic process modeling language for workflows… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1999
Highly Cited
1999
The foundation of a process model lies in its control flow specifications. Using a generic process modeling language for… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1993
Highly Cited
1993
We show how membership in classes of graphs definable in monadic second order logic and of bounded treewidth can be decided by… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1992
Highly Cited
1992
We present the a-calculus, a calculus of communicating systems in which one can naturally express processes which have changing… Expand
  • figure 1
  • figure 2
  • figure 3
Is this relevant?