scientific article; zbMATH DE number 1156661

zbMath0895.05061MaRDI QIDQ4390698

Alan P. Sprague

Publication date: 14 September 1998

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

recognition algorithmunit interval graphsbipartite permutation graphs

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (7)

Finding a chain graph in a bipartite permutation graph ⋮ Weighted efficient domination problem on some perfect graphs ⋮ Double-threshold permutation graphs ⋮ \(O(1)\) query time algorithm for all pairs shortest distances on permutation graphs ⋮ Polynomial-time algorithms for subgraph isomorphism in small graph classes of perfect graphs ⋮ Circularly Compatible Ones, $D$-Circularity, and Proper Circular-Arc Bigraphs ⋮ Linear-time recognition of double-threshold graphs

This page was built for publication: