A Unified View of Graph Searching
From MaRDI portal
Publication:3648497
DOI10.1137/050623498zbMath1186.05113OpenAlexW2080222130WikidataQ56639276 ScholiaQ56639276MaRDI QIDQ3648497
R. Krueger, Derek Gordon Corneil
Publication date: 27 November 2009
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/050623498
Nonnumerical algorithms (68W05) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items
Recognizing graph search trees ⋮ The LexCycle on $\overline{P_{2}\cup P_{3}}$-free Cocomparability Graphs ⋮ A Linear-Time Algorithm for Maximum-Cardinality Matching on Cocomparability Graphs ⋮ Graph searches and their end vertices ⋮ Graph extremities defined by search algorithms ⋮ Computing a clique tree with the algorithm maximal label search ⋮ Vertex Ordering Characterizations of Graphs of Bounded Asteroidal Number ⋮ End-Vertices of Graph Search Algorithms ⋮ Linearizing partial search orders ⋮ A general label search to investigate classical graph search algorithms ⋮ Organizing the atoms of the clique separator decomposition into an atom tree ⋮ A tie-break model for graph search ⋮ Unnamed Item ⋮ The continuum limit of critical random graphs ⋮ A simple algorithm to generate the minimal separators and the maximal cliques of a chordal graph ⋮ Distributed computing of efficient routing schemes in generalized chordal graphs ⋮ A new graph parameter to measure linearity ⋮ Moplex orderings generated by the LexDFs algorithm ⋮ End vertices of graph searches on bipartite graphs ⋮ End-vertices of LBFS of (AT-free) bigraphs ⋮ On end-vertices of lexicographic breadth first searches ⋮ On the Power of Graph Searching for Cocomparability Graphs ⋮ A five-element transformation monoid on labelled trees ⋮ Distributed Computing of Efficient Routing Schemes in Generalized Chordal Graphs ⋮ The Recognition Problem of Graph Search Trees ⋮ Bayesian networks: the minimal triangulations of a graph ⋮ Graph Classes and Forbidden Patterns on Three Vertices ⋮ Efficiently decomposing, recognizing and triangulating hole-free graphs without diamonds ⋮ Extremities and orderings defined by generalized graph search algorithms ⋮ Simple vertex ordering characterizations for graph search
This page was built for publication: A Unified View of Graph Searching
