A general label search to investigate classical graph search algorithms
From MaRDI portal
Publication:617648
DOI10.1016/J.DAM.2010.02.011zbMath1225.05232OpenAlexW1981843507MaRDI QIDQ617648
R. Krueger, Anne Berry, Geneviève Simonet
Publication date: 21 January 2011
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://hal-lirmm.ccsd.cnrs.fr/lirmm-00565874/file/publiGLS.pdf
Searching and sorting (68P10) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (7)
Computing a clique tree with the algorithm maximal label search ⋮ Linearizing partial search orders ⋮ Space-efficient algorithms for maximum cardinality search, its applications, and variants of BFS ⋮ Organizing the atoms of the clique separator decomposition into an atom tree ⋮ A tie-break model for graph search ⋮ Graph Search Trees and Their Leaves ⋮ On the recognition of search trees generated by BFS and DFS
Cites Work
- Unnamed Item
- Some aspects of perfect elimination orderings in chordal graphs
- Preserving order in a forest in less than logarithmic time and linear space
- LexBFS-orderings and powers of chordal graphs
- Lex-BFS and partition refinement, with applications to transitive orientation, interval graph recognition and consecutive ones testing
- On the semi-perfect elimination
- Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
- A Unified View of Graph Searching
- A Simple Linear Time LexBFS Cograph Recognition Algorithm
- Algorithmic Aspects of Vertex Elimination on Graphs
- Design and implementation of an efficient priority queue
- Maximal Label Search Algorithms to Compute Perfect and Minimal Elimination Orderings
- Depth-First Search and Linear Graph Algorithms
- Graph-Theoretic Concepts in Computer Science
This page was built for publication: A general label search to investigate classical graph search algorithms
