Graph-Theoretic Concepts in Computer Science
From MaRDI portal
Publication:5710792
DOI10.1007/b104584zbMath1112.68414OpenAlexW4211210842MaRDI QIDQ5710792
Publication date: 8 December 2005
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b104584
Graph theory (including graph drawing) in computer science (68R10) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (18)
Medians in median graphs and their cube complexes in linear time ⋮ A new LBFS-based algorithm for cocomparability graph recognition ⋮ Graph searches and their end vertices ⋮ A general label search to investigate classical graph search algorithms ⋮ Linear optimization over homogeneous matrix cones ⋮ A tie-break model for graph search ⋮ Finding biclique partitions of co-chordal graphs ⋮ A directional heuristics pulse algorithm for a two resources constrained shortest path problem with reinitialization ⋮ Ramified rectilinear polygons: coordinatization by dendrons ⋮ A survey of the algorithmic aspects of modular decomposition ⋮ Practical and efficient circle graph recognition ⋮ Practical and efficient split decomposition via graph-labelled trees ⋮ End-vertices of LBFS of (AT-free) bigraphs ⋮ A simple linear time certifying LBFS-based algorithm for recognizing trivially perfect graphs and their complements ⋮ On end-vertices of lexicographic breadth first searches ⋮ The lexicographic method for the threshold cover problem ⋮ Laminar structure of ptolemaic graphs with applications ⋮ Simple vertex ordering characterizations for graph search
This page was built for publication: Graph-Theoretic Concepts in Computer Science
