Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 209,890,451 papers from all fields of science
Search
Sign In
Create Free Account
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
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
13 relations
Clean
Computer science
Data structure
David Turner (computer scientist)
Expand
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…
Expand
Highly Cited
2012
Highly Cited
2012
Semantic graph reduction approach for abstractive Text Summarization
I. Moawad
,
M. 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…
Expand
Highly Cited
2011
Highly Cited
2011
Graph Partitioning with Natural Cuts
D. Delling
,
A. Goldberg
,
Ilya P. Razenshteyn
,
Renato F. Werneck
IEEE International Parallel and Distributed…
2011
Corpus ID: 6884123
We present a novel approach to graph partitioning based on the notion of \emph{natural cuts}. Our algorithm, called PUNCH, has…
Expand
Highly Cited
2002
Highly Cited
2002
A compiled implementation of strong reduction
B. Grégoire
,
X. Leroy
ACM SIGPLAN International Conference on…
2002
Corpus ID: 5887840
Motivated by applications to proof assistants based on dependent types, we develop and prove correct a strong reducer and…
Expand
Highly Cited
2001
Highly Cited
2001
Reduction Algorithms for Graphs of Small Treewidth
H. Bodlaender
,
B. D. Fluiter
Information and Computation
2001
Corpus ID: 6836551
This paper presents a number of new ideas and results on graph reduction applied to graphs of bounded treewidth. S. Arnborg, B…
Expand
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…
Expand
Highly Cited
1995
Highly Cited
1995
Geometric constraint solver
William J. Bouma
,
I. Fudos
,
C. Hoffmann
,
Jiazhen Cai
,
R. Paige
Comput. Aided Des.
1995
Corpus ID: 3264613
Highly Cited
1992
Highly Cited
1992
A Calculus of Mobile Processes, II
R. Milner
,
J. Parrow
,
D. Walker
Information and Computation
1992
Corpus ID: 39498365
Highly Cited
1992
Highly Cited
1992
Calculus of Mobile Processes
R. Milner
,
J. Parrow
,
D. Walker
Encyclopedia of Parallel Computing
1992
Corpus ID: 31508937
We present the a-calculus, a calculus of communicating systems in which one can naturally express processes which have changing…
Expand
Highly Cited
1989
Highly Cited
1989
A Calculus of Mobile Processes, Part I
D. Walker
1989
Corpus ID: 17166120
We present the -calculus, a calculus of communicating systems in which one can naturally express processes which have changing…
Expand
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)
ACCEPT & CONTINUE