An algorithm for the blocks and cutnodes of a graph
Communications of the ACM
Planarity testing in V log V steps: extended abstract
Planarity testing in V log V steps: extended abstract
Implementation and analysis of efficient graph planarity testing algorithms
Implementation and analysis of efficient graph planarity testing algorithms
The input/output complexity of transitive closure
SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
A general approach to connected-component labeling for arbitrary image representations
Journal of the ACM (JACM)
Structuring depth-first search algorithms in Haskell
POPL '95 Proceedings of the 22nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A data structure for circuit net lists
DAC '88 Proceedings of the 25th ACM/IEEE Design Automation Conference
Identifying loops in almost linear time
ACM Transactions on Programming Languages and Systems (TOPLAS)
Journal of the ACM (JACM)
Global Data Flow Analysis and Iterative Algorithms
Journal of the ACM (JACM)
On the complexity of edge traversing
Journal of the ACM (JACM)
An Algorithm to Enumerate All Cutsets of a Graph in Linear Time per Cutset
Journal of the ACM (JACM)
Journal of the ACM (JACM)
Data Flow Analysis in Software Reliability
ACM Computing Surveys (CSUR)
A Survey of Analysis Techniques for Discrete Algorithms
ACM Computing Surveys (CSUR)
Efficiently searching a graph by a smell-oriented vertex process
Annals of Mathematics and Artificial Intelligence
Search in Indecomposable Graphs
WG '02 Revised Papers from the 28th International Workshop on Graph-Theoretic Concepts in Computer Science
Interactive space layout: A graph theoretical approach
DAC '78 Proceedings of the 15th Design Automation Conference
STOC '74 Proceedings of the sixth annual ACM symposium on Theory of computing
The subgraph homeomorphism problem
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
Linear expected-time algorithms for connectivity problems (Extended Abstract)
STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
A general linear-time evaluator for attribute grammars
ACM SIGPLAN Notices
Applications of Forman's Discrete Morse Theory to Topology Visualization and Mesh Compression
IEEE Transactions on Visualization and Computer Graphics
Algorithms for computing a parameterized st-orientation
Theoretical Computer Science
Dividing Protein Interaction Networks by Growing Orthologous Articulations
PRIB '08 Proceedings of the Third IAPR International Conference on Pattern Recognition in Bioinformatics
Efficient Clustering of Web-Derived Data Sets
MLDM '09 Proceedings of the 6th International Conference on Machine Learning and Data Mining in Pattern Recognition
Treedecomposition of geometric constraint graphs based on computing graph circuits
2009 SIAM/ACM Joint Conference on Geometric and Physical Modeling
Algorithms for memory hierarchies: advanced lectures
Algorithms for memory hierarchies: advanced lectures
Parameterized st-orientations of graphs: algorithms and experiments
GD'06 Proceedings of the 14th international conference on Graph drawing
Higher order Voronoi diagrams of segments for VLSI critical area extraction
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
Topology-aware replica placement in fault-tolerant embedded networks
ARCS'08 Proceedings of the 21st international conference on Architecture of computing systems
Deadlock avoidance for streaming computations with filtering
Proceedings of the twenty-second annual ACM symposium on Parallelism in algorithms and architectures
Cover-incomparability graphs and chordal graphs
Discrete Applied Mathematics
Dividing protein interaction networks for modular network comparative analysis
Pattern Recognition Letters
Identifying functional relations in web text
EMNLP '10 Proceedings of the 2010 Conference on Empirical Methods in Natural Language Processing
A model-driven heuristic approach for detecting multidimensional facts in relational data sources
DaWaK'10 Proceedings of the 12th international conference on Data warehousing and knowledge discovery
Algorithms and theory of computation handbook
Built-in data-flow integration testing in large-scale component-based systems
ICTSS'10 Proceedings of the 22nd IFIP WG 6.1 international conference on Testing software and systems
The biconnected verification of workflow nets
OTM'10 Proceedings of the 2010 international conference on On the move to meaningful internet systems - Volume Part I
GlobFit: consistently fitting primitives by discovering global relations
ACM SIGGRAPH 2011 papers
Tree search and quantum computation
Quantum Information Processing
Discovering highly reliable subgraphs in uncertain graphs
Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining
Software is a directed multigraph
ECSA'11 Proceedings of the 5th European conference on Software architecture
Power control methods for improving spatial reuse in TDMA-based wireless mesh networks
ISRN Communications and Networking
Scheduling tasks and communications on a hierarchical system with message contention
ICA3PP'11 Proceedings of the 11th international conference on Algorithms and architectures for parallel processing - Volume Part II
Applications of parameterized st-orientations in graph drawing algorithms
GD'05 Proceedings of the 13th international conference on Graph Drawing
On a class of branching problems in broadcasting and distribution
Computers and Operations Research
European Journal of Combinatorics
Optimal seeding of self-reproducing systems
Artificial Life
An efficient ear localization technique
Image and Vision Computing
Better speedups using simpler parallel programming for graph connectivity and biconnectivity
Proceedings of the 2012 International Workshop on Programming Models and Applications for Multicores and Manycores
A proposal to detect errors in Enterprise Application Integration solutions
Journal of Systems and Software
Dominating induced matchings for p
ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
Algorithms to Detect Multiprotein Modularity Conserved during Evolution
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
ASSET: A life cycle verification and visibility system
Journal of Systems and Software
Brief announcement: speedups for parallel graph triconnectivity
Proceedings of the twenty-fourth annual ACM symposium on Parallelism in algorithms and architectures
Logic and Program Semantics
Towards ABox Modularization of semi-expressive Description Logics
Applied Ontology - Modularity in Ontologies
A decomposition approach for solving critical clique detection problems
SEA'12 Proceedings of the 11th international conference on Experimental Algorithms
Aesthetic layout of wiring diagrams
Diagrams'12 Proceedings of the 7th international conference on Diagrammatic Representation and Inference
Concept-relational text clustering
International Journal of Intelligent Systems
Computational Statistics & Data Analysis
Computing connected components of simple undirected graphs based on generalized rough sets
Knowledge-Based Systems
On the role of expander graphs in key predistribution schemes for wireless sensor networks
WEWoRC'11 Proceedings of the 4th Western European conference on Research in Cryptology
Finding quality issues in SKOS vocabularies
TPDL'12 Proceedings of the Second international conference on Theory and Practice of Digital Libraries
An improved test generation approach from extended finite state machines using genetic algorithms
SEFM'12 Proceedings of the 10th international conference on Software Engineering and Formal Methods
A branch and prune algorithm for the computation of generalized aspects of parallel robots
CP'12 Proceedings of the 18th international conference on Principles and Practice of Constraint Programming
Parameterized algorithms for even cycle transversal
WG'12 Proceedings of the 38th international conference on Graph-Theoretic Concepts in Computer Science
A patent intelligence system for strategic technology planning
Expert Systems with Applications: An International Journal
Coalition structure generation over graphs
Journal of Artificial Intelligence Research
Percolation Computation in Complex Networks
ASONAM '12 Proceedings of the 2012 International Conference on Advances in Social Networks Analysis and Mining (ASONAM 2012)
Push and rotate: cooperative multi-agent path planning
Proceedings of the 2013 international conference on Autonomous agents and multi-agent systems
Maximizing influence of viral marketing via evolutionary user selection
Proceedings of the 2013 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining
Discovering tasks from search engine query logs
ACM Transactions on Information Systems (TOIS)
ThermoSense: Occupancy Thermal Based Sensing for HVAC Control
Proceedings of the 5th ACM Workshop on Embedded Systems For Energy-Efficient Buildings
TOSS: Thermal Occupancy Sensing System
Proceedings of the 5th ACM Workshop on Embedded Systems For Energy-Efficient Buildings
Novel feature selection methods to financial distress prediction
Expert Systems with Applications: An International Journal
Autonomous Robots
| Hi-index | 48.22 |
Efficient algorithms are presented for partitioning a graph into connected components, biconnected components and simple paths. The algorithm for partitioning of a graph into simple paths of iterative and each iteration produces a new path between two vertices already on paths. (The start vertex can be specified dynamically.) If V is the number of vertices and E is the number of edges, each algorithm requires time and space proportional to max (V, E) when executed on a random access computer.