scientific article; zbMATH DE number 1156661

MaRDI QIDQ4390698zbMATH OpenFDO

Authors Alan P. Sprague

Publication date 14 September 1998

zbMATH Keywords

recognition algorithmunit interval graphsbipartite permutation graphs

Mathematics Subject Classification ID

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

Recommendations

• Bipartite permutation graphs
• Efficient parallel algorithms for bipartite permutation graphs
• Recognizing Bipartite Tolerance Graphs in Linear Time
• Bipartite permutation graphs with application to the minimum buffer size problem

Cited in

(16)

• Linear structure of bipartite permutation graphs and the longest path problem
• Bipartite Permutation Graphs Are Reconstructible
• On opposition graphs, coalition graphs, and bipartite permutation graphs
• Fully dynamic algorithm for recognition and modular decomposition of permutation graphs
• Finding a chain graph in a bipartite permutation graph
• Linear-time recognition of double-threshold graphs
• Polynomial-time algorithms for subgraph isomorphism in small graph classes of perfect graphs
• \(O(1)\) query time algorithm for all pairs shortest distances on permutation graphs
• Bipartite permutation graphs
• Efficient parallel algorithms for bipartite permutation graphs
• Recognizing Perfect 2-Split Graphs
• Double-threshold permutation graphs
• Weighted efficient domination problem on some perfect graphs
• scientific article; zbMATH DE number 4063153 (Why is no real title available?)
• Recognition and combinatorial optimization algorithms for bipartite chain graphs
• Circularly compatible ones, D-circularity, and proper circular-arc bigraphs

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4390698)