Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 234,978,402 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.
2013
2013
Go straight, turn right: Pose graph reduction through trajectory segmentation using line segments
Y. Latif
,
José Neira
European Conference on Mobile Robots
2013
Corpus ID: 18457895
With better hardware and more efficient graph-SLAM solvers, we are able to solve increasingly large mapping problems. An actual…
Expand
Review
2012
Review
2012
Mining potential research synergies from co-authorship graphs using power graph analysis
Iraklis Varlamis
,
G. Tsatsaronis
International Journal of Web Engineering and…
2012
Corpus ID: 17643984
Bibliographic databases are a prosperous field for data mining research and social network analysis. They contain rich…
Expand
2012
2012
A Novel Technique for Call Graph Reduction for Bug Localization
Prabhdeep Singh
,
Shalini Batra
2012
Corpus ID: 8538431
era, software industries are competing for software quality which depends upon the sound software testing phase. To deliver the…
Expand
2007
2007
Connectivity and Topology Control in Wireless Ad Hoc Networks with Realistic Physical Layer
Fadila Khadar
,
D. Simplot-Ryl
International Conference on Wireless and Mobile…
2007
Corpus ID: 38403071
This paper presents a way of controling topology in wireless ad hoc networks while using a realistic physical layer. We first…
Expand
2007
2007
A Workflow Verification Method Based on Calculus.
Fei Xu
,
Zhiwei Yu
Theoretical Aspects of Software Engineering
2007
Corpus ID: 14678058
Awareness of the need for process orientation in IT support field has been increasing these decades, which made the formalization…
Expand
2007
2007
Variable Neighborhood Search for the Generalized Minimum Edge Biconnected Network Problem
Markus Leitner
,
Bin Hu
,
G. Raidl
2007
Corpus ID: 2070825
The Generalized Minimum Edge Biconnected Network Problem (GMEBCNP) is defined as follows. We consider an undirected weighted…
Expand
2003
2003
Towards Automating Intrusion Alert Analysis ∗
P. Ning
,
Yun Cui
,
D. Reeves
,
Dingbang Xu
2003
Corpus ID: 14417563
Traditional intrusion detection systems (IDSs) focus on low-level attacks or anomalies, and raise alerts independently, though…
Expand
1994
1994
Uniqueness Typing in Theory and PracticeErik
E. Barendsen
,
S. Smetsers
1994
Corpus ID: 14267219
We present uniqueness typing as an extension of a familiar Curry style typing system for graph rewrite systems. This provides a…
Expand
1994
1994
Partitioning non-strict languages for multi-threaded code generation
S. Coorg
1994
Corpus ID: 28887901
In a non-strict language, functions may return values before their arguments are available, and data structures may be defined…
Expand
1991
1991
On the Beneets of Diierent Analyses in the Compilation of a Lazy Functional Language
P. Hartel
,
H. Glaser
,
J. Wild
1991
Corpus ID: 15594271
Implementations of lazy functional languages have not as yet approached the speed of execution provided by imperative, or even…
Expand