Graph extremities defined by search algorithms
From MaRDI portal
Publication:1662546
Recommendations
- Extremities and orderings defined by generalized graph search algorithms
- scientific article; zbMATH DE number 4174651
- scientific article; zbMATH DE number 4156240
- Graph searches and their end vertices
- Graph Searches and Their End Vertices.
- End-vertices of graph search algorithms
- scientific article; zbMATH DE number 815069
- Search problems on graphs
- scientific article; zbMATH DE number 861311
- Algorithms and complexity results for finding graphs with extremal Randić index
Cites work
- scientific article; zbMATH DE number 554762 (Why is no real title available?)
- A Unified View of Graph Searching
- A wide-range algorithm for minimal triangulation from an arbitrary ordering
- Algorithmic Aspects of Vertex Elimination on Graphs
- Asteroidal Triple-Free Graphs
- Extremities and orderings defined by generalized graph search algorithms
- Incidence matrices and interval graphs
- LexBFS-orderings and powers of chordal graphs
- LexBFS-orderings of distance-hereditary graphs with application to the diametral pair problem
- Linear Time Algorithms for Dominating Pairs in Asteroidal Triple-free Graphs
- Maximal label search algorithms to compute perfect and minimal elimination orderings
- Maximum cardinality search for computing minimal triangulations of graphs
- Minimal triangulation of a graph and optimal pivoting order in a sparse matrix
- On rigid circuit graphs
- Recognizing weakly triangulated graphs by edge separability
- Representation of a finite graph by a set of intervals on the real line
- Separability generalizes Dirac's theorem
- Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
- Triangulated graphs and the elimination process
Cited in
(13)- Efficiently decomposing, recognizing and triangulating hole-free graphs without diamonds
- Graph searches and their end vertices
- Computing a clique tree with the algorithm maximal label search
- Extremities and orderings defined by generalized graph search algorithms
- Organizing the atoms of the clique separator decomposition into an atom tree
- Computing and listing avoidable vertices and paths
- A simple algorithm to generate the minimal separators and the maximal cliques of a chordal graph
- scientific article; zbMATH DE number 861311 (Why is no real title available?)
- Graphs with at most two moplexes
- Avoidable vertices and edges in graphs: existence, characterization, and applications
- End-vertices of LBFS of (AT-free) bigraphs
- Moplex orderings generated by the LexDFs algorithm
- Computing and listing avoidable vertices and paths
This page was built for publication: Graph extremities defined by search algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1662546)
