Biconvex graphs: Ordering and algorithms

DOI10.1016/S0166-218X(99)00217-6zbMath0977.68064WikidataQ127780862 ScholiaQ127780862MaRDI QIDQ1570816

Lorna K. Stewart, Nesrine Abbas

Publication date: 11 July 2000

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

biconvex graphsS-ordering

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Related Items (10)

Fair Packing of Independent Sets ⋮ Constructing a minimum height elimination tree of a tree in linear time ⋮ Induced matchings in strongly biconvex graphs and some algebraic applications ⋮ Path eccentricity of graphs ⋮ On factorial properties of chordal bipartite graphs ⋮ Fair allocation of indivisible items with conflict graphs ⋮ \(L(2,1)\)-labeling of perfect elimination bipartite graphs ⋮ A Polynomial Time Algorithm for Longest Paths in Biconvex Graphs ⋮ On list \(k\)-coloring convex bipartite graphs ⋮ Chordal bipartite graphs of bounded tree- and clique-width

Cites Work

• Unnamed Item
• Unnamed Item
• Efficient parallel algorithms for doubly convex-bipartite graphs
• Characterizations of strongly chordal graphs
• Bipartite permutation graphs
• Efficient algorithms for finding maximum matchings in convex bipartite graphs and related problems
• A structure theorem for the consecutive 1's property
• Polygon Graph Recognition
• Rankings of Graphs
• Efficient Parallel Algorithms for Chordal Graphs
• Maximum matching in a convex bipartite graph

This page was built for publication: Biconvex graphs: Ordering and algorithms