On end-vertices of lexicographic breadth first searches
From MaRDI portal
Publication:968161
DOI10.1016/J.DAM.2009.10.001zbMATH Open1225.05229OpenAlexW2086423153MaRDI QIDQ968161FDOQ968161
Derek G. Corneil, Jean-Marc Lanlignel, Ekkehard Köhler
Publication date: 5 May 2010
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2009.10.001
complexitygraph algorithminterval graphssimplicial vertexchordal graphscocomparability graphsgraph classesAT-free graphslexicographic breadth first search
Cites Work
- Domination on Cocomparability Graphs
- Diameter determination on restricted graph families
- Lex-BFS and partition refinement, with applications to transitive orientation, interval graph recognition and consecutive ones testing
- Representation of a finite graph by a set of intervals on the real line
- Algorithmic Aspects of Vertex Elimination on Graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Graph-Theoretic Concepts in Computer Science
- Linear Time Algorithms for Dominating Pairs in Asteroidal Triple-free Graphs
- A Unified View of Graph Searching
- LexBFS-orderings and powers of chordal graphs
- Almost diameter of a house-hole-free graph in linear time via LexBFS
Cited In (10)
- Graph-Theoretic Concepts in Computer Science
- Recognizing graph search trees
- Linearizing partial search orders
- Graph searches and their end vertices
- End vertices of graph searches on bipartite graphs
- End-Vertices of Graph Search Algorithms
- Graph Search Trees and Their Leaves
- The Recognition Problem of Graph Search Trees
- Similarity-First Search: A New Algorithm with Application to Robinsonian Matrix Recognition
- End-vertices of LBFS of (AT-free) bigraphs
Recommendations
This page was built for publication: On end-vertices of lexicographic breadth first searches
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q968161)
