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)

Related topics

Related topics

13 relations
CleanComputer scienceData structureDavid Turner (computer scientist)

Broader (1)

Graph rewriting

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2018
Highly Cited
2018
Graph Reduction with Spectral and Cut Guarantees
  • 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
Semantic graph reduction approach for abstractive Text Summarization
  • 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
Graph Partitioning with Natural Cuts
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
A compiled implementation of strong reduction
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
Reduction Algorithms for Graphs of Small Treewidth
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
Comparing Hierarchical Data in External Memory
  • 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
Geometric constraint solver
Highly Cited
1992
Highly Cited
1992
A Calculus of Mobile Processes, II
Highly Cited
1992
Highly Cited
1992
Calculus of Mobile Processes
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
A Calculus of Mobile Processes, Part I
We present the -calculus, a calculus of communicating systems in which one can naturally express processes which have changing… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)