Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2018
Highly Cited
2018
  • Andreas Loukas
  • Journal of machine learning research
  • 2018
  • Corpus ID: 57189462
Can one reduce the size of a graph without significantly altering its basic properties? The graph reduction problem is hereby… 
Highly Cited
2012
Highly Cited
2012
  • I. MoawadM. Aref
  • International Conference on Communication and…
  • 2012
  • Corpus ID: 15122896
One of the important Natural Language Processing applications is Text Summarization, which helps users to manage the vast amount… 
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… 
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… 
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… 
Highly Cited
1999
Highly Cited
1999
  • S. Chawathe
  • Very Large Data Bases Conference
  • 1999
  • Corpus ID: 36336
We present an external-memory algorithm for computing a minimum-cost edit script between two rooted, ordered, labeled trees. The… 
Highly Cited
1995
Highly Cited
1995
Highly Cited
1992
Highly Cited
1992
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… 
Highly Cited
1989
Highly Cited
1989
We present the -calculus, a calculus of communicating systems in which one can naturally express processes which have changing…