A Depth-first Algorithm to Reduce Graphs in Linear Time (original) (raw)
Related papers
MaRs: a parallel graph reduction multiprocessor
Computer architecture news, 1988
Parallel graph reduction with the (v , G)-machine
Proceedings of the fourth international conference on Functional programming languages and computer architecture - FPCA '89, 1989
Revisiting AS-Level Graph Reduction
International Workshop on Network Science for Communication Networks (NetSciCom), 2016
Divide-and-Conquer and parallel graph reduction
Parallel Computing, 1991
Non-planar Core Reduction of Graphs
Lecture Notes in Computer Science, 2006
A practical algorithm for making filled graphs minimal
Theoretical Computer Science, 2001
Experiments with a transputer-based parallel graph reduction machine
Concurrency: Practice and Experience, 1991
A Linear Algorithm for Restructuring a Graph
Automation and Remote Control, 2018
DEPTH-FIRST SEARCH AND LINEAR GRAPH ALGORITHMS
A Distributed Virtual Machine for Parallel Graph Reduction
Peter Kelly, Andrew Wendelborn
8th International Conference on Parallel and Distributed Computing Applications and Technologies (PDCAT '07), 2007
The TRANSPOSE machine-a global implementation of a parallel graph reducer
Reinhard Wilhelm, Yosi Ben-asher
Fourth IEEE Region 10 International Conference TENCON, 1989
Engineering DFS-based graph algorithms
Distributed implementation of programmed graph reduction
Lecture Notes in Computer Science, 1989
Minimal elimination of planar graphs
Lecture Notes in Computer Science, 1998
An efficient parallel algorithm for the minimal elimination ordering (MEO) of an arbitrary graph
Theoretical Computer Science, 1994
PARALLEL ALGORITHMS FOR TRANSITIVE REDUCTION FOR WEIGHTED GRAPHS
Space-efficient basic graph algorithms
Why Depth-First Search Efficiently Identifies Two and Three-Connected Graphs
Lecture Notes in Computer Science, 2010
Efficient shared-memory support for parallel graph reduction
Future Generation Computer Systems, 1997
New methods for reducing size graphs
International journal of computer …, 1999
On double-star decomposition of graphs
Discussiones Mathematicae Graph Theory, 2017
A Near-optimal Algorithm for Edge Connectivity-based Hierarchical Graph Decomposition
ArXiv, 2017
Algorithm 447: efficient algorithms for graph manipulation
Communications of the ACM, 1973
A Survey on Graph Reduction Methods and Applications
Computing Minimal Spanning Subgraphs In Linear Time
Proceedings of the third …, 1992
External memory K-bisimulation reduction of big graphs
Proceedings of the 22nd ACM international conference on Conference on information & knowledge management - CIKM '13, 2013
Decomposable trees: a polynomial algorithm for tripodes
Discrete Applied Mathematics, 2002
Scalable K-Core Decomposition for Static Graphs Using a Dynamic Graph Data Structure
2018 IEEE International Conference on Big Data (Big Data)
A simple and practical linear-work parallel algorithm for connectivity
Proceedings of the 26th ACM symposium on Parallelism in algorithms and architectures, 2014
Shortest path computations in source-deplanarized graphs
Information Processing Letters, 1993
Parallel graph decomposition and diameter approximation in o (diameter) time and linear space