Linearizing partial search orders

DOI10.1007/978-3-031-15914-5_31arXiv2206.14556OpenAlexW4312378659MaRDI QIDQ6039439

Robert Scheffler

Publication date: 5 May 2023

Published in: Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2206.14556

zbMATH Keywords

MCSpartial ordergraph searchLBFSend-vertex problemsearch tree recognition

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Cites Work

• Unnamed Item
• Unnamed Item
• A new LBFS-based algorithm for cocomparability graph recognition
• End-vertices of LBFS of (AT-free) bigraphs
• A general label search to investigate classical graph search algorithms
• A tie-break model for graph search
• A simple linear time certifying LBFS-based algorithm for recognizing trivially perfect graphs and their complements
• On end-vertices of lexicographic breadth first searches
• Minimal vertex separators of chordal graphs
• Maximum cardinality search for computing minimal triangulations of graphs
• Recognizing graph search trees
• Graph searches and their end vertices
• The LBFS Structure and Recognition of Interval Graphs
• Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
• A Unified View of Graph Searching
• A Simple Linear Time LexBFS Cograph Recognition Algorithm
• Efficient Planarity Testing
• Algorithmic Aspects of Vertex Elimination on Graphs
• The Recognition Problem of Graph Search Trees

This page was built for publication: Linearizing partial search orders