Graph extremities defined by search algorithms
From MaRDI portal
Publication:1662546
DOI10.3390/A3020100zbMATH Open1461.05202OpenAlexW2117033169MaRDI QIDQ1662546FDOQ1662546
Authors: Anne Berry, Jean R. S. Blair, Jean-Paul Bordat, Geneviève Simonet 
Publication date: 20 August 2018
Published in: Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3390/a3020100
Recommendations
- Extremities and orderings defined by generalized graph search algorithms
- scientific article
- scientific article
- 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
- Incidence matrices and interval graphs
- On rigid circuit graphs
- Representation of a finite graph by a set of intervals on the real line
- Triangulated graphs and the elimination process
- Asteroidal Triple-Free Graphs
- Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
- Algorithmic Aspects of Vertex Elimination on Graphs
- Recognizing weakly triangulated graphs by edge separability
- Title not available (Why is that?)
- Linear Time Algorithms for Dominating Pairs in Asteroidal Triple-free Graphs
- Separability generalizes Dirac's theorem
- Maximum cardinality search for computing minimal triangulations of graphs
- A Unified View of Graph Searching
- A wide-range algorithm for minimal triangulation from an arbitrary ordering
- Minimal triangulation of a graph and optimal pivoting order in a sparse matrix
- LexBFS-orderings and powers of chordal graphs
- LexBFS-orderings of distance-hereditary graphs with application to the diametral pair problem
- Maximal label search algorithms to compute perfect and minimal elimination orderings
- Extremities and orderings defined by generalized graph search algorithms
Cited In (13)
- Organizing the atoms of the clique separator decomposition into an atom tree
- Efficiently decomposing, recognizing and triangulating hole-free graphs without diamonds
- Title not available (Why is that?)
- Graphs with at most two moplexes
- Computing and listing avoidable vertices and paths
- A simple algorithm to generate the minimal separators and the maximal cliques of a chordal graph
- Computing a clique tree with the algorithm maximal label search
- Graph searches and their end vertices
- Moplex orderings generated by the LexDFs algorithm
- Avoidable vertices and edges in graphs: existence, characterization, and applications
- Computing and listing avoidable vertices and paths
- Extremities and orderings defined by generalized graph search algorithms
- End-vertices of LBFS of (AT-free) bigraphs
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)
