The following pages link to A Unified View of Graph Searching (Q3648497):
Displaying 32 items.
- Organizing the atoms of the clique separator decomposition into an atom tree (Q406311) (← links)
- Distributed computing of efficient routing schemes in generalized chordal graphs (Q442251) (← links)
- End-vertices of LBFS of (AT-free) bigraphs (Q528559) (← links)
- A general label search to investigate classical graph search algorithms (Q617648) (← links)
- A tie-break model for graph search (Q896657) (← links)
- On end-vertices of lexicographic breadth first searches (Q968161) (← links)
- Graph extremities defined by search algorithms (Q1662546) (← links)
- Computing a clique tree with the algorithm maximal label search (Q1662609) (← links)
- A new graph parameter to measure linearity (Q1708605) (← links)
- A simple algorithm to generate the minimal separators and the maximal cliques of a chordal graph (Q1944936) (← links)
- Recognizing graph search trees (Q2132337) (← links)
- Graph searches and their end vertices (Q2165035) (← links)
- End vertices of graph searches on bipartite graphs (Q2234808) (← links)
- A five-element transformation monoid on labelled trees (Q2311382) (← links)
- Bayesian networks: the minimal triangulations of a graph (Q2330088) (← links)
- Efficiently decomposing, recognizing and triangulating hole-free graphs without diamonds (Q2341752) (← links)
- The continuum limit of critical random graphs (Q2428503) (← links)
- Moplex orderings generated by the LexDFs algorithm (Q2446863) (← links)
- On the Power of Graph Searching for Cocomparability Graphs (Q2801333) (← links)
- Vertex Ordering Characterizations of Graphs of Bounded Asteroidal Number (Q2940988) (← links)
- End-Vertices of Graph Search Algorithms (Q2947028) (← links)
- Distributed Computing of Efficient Routing Schemes in Generalized Chordal Graphs (Q3408176) (← links)
- Extremities and orderings defined by generalized graph search algorithms (Q3439374) (← links)
- Simple vertex ordering characterizations for graph search (Q3439379) (← links)
- A Linear-Time Algorithm for Maximum-Cardinality Matching on Cocomparability Graphs (Q4561265) (← links)
- The LexCycle on $\overline{P_{2}\cup P_{3}}$-free Cocomparability Graphs (Q4987262) (← links)
- The Recognition Problem of Graph Search Trees (Q4997136) (← links)
- Graph Classes and Forbidden Patterns on Three Vertices (Q5855535) (← links)
- (Q5874479) (← links)
- Maximal Cliques Lattices Structures for Cocomparability Graphs with Algorithmic Applications (Q6493757) (← links)
- Graphs with at most two moplexes (Q6595515) (← links)
- Semi-proper interval graphs (Q6648246) (← links)
