Graph searches and their end vertices
From MaRDI portal
Publication:2165035
DOI10.1007/s00453-022-00981-5OpenAlexW2946173551MaRDI QIDQ2165035
Jianxin Wang, Yixin Cao, Zhifeng Wang, Guozhen Rong
Publication date: 18 August 2022
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1905.09505
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On rigid circuit graphs
- Some aspects of perfect elimination orderings in chordal graphs
- On end-vertices of lexicographic breadth first searches
- Separability generalizes Dirac's theorem
- Lex-BFS and partition refinement, with applications to transitive orientation, interval graph recognition and consecutive ones testing
- Graph extremities defined by search algorithms
- A simple 3-sweep LBFS algorithm for the recognition of unit interval graphs
- End vertices of graph searches on bipartite graphs
- Incidence matrices and interval graphs
- LDFS-Based Certifying Algorithm for the Minimum Path Cover Problem on Cocomparability Graphs
- End-Vertices of Graph Search Algorithms
- The LBFS Structure and Recognition of Interval Graphs
- Simpler Linear-Time Modular Decomposition Via Recursive Factorizing Permutations
- Algorithmic Aspects of Graph Connectivity
- A Unified View of Graph Searching
- Addendum: Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
- Power of Natural Semijoins
- Computing Edge-Connectivity in Multigraphs and Capacitated Graphs
- Efficient Planarity Testing
- Scheduling Graphs on Two Processors
- Algorithmic Aspects of Vertex Elimination on Graphs
- Linear Time Algorithms for Dominating Pairs in Asteroidal Triple-free Graphs
- Depth-First Search and Linear Graph Algorithms
- Graph-Theoretic Concepts in Computer Science
- On the complexity of \(k\)-SAT
