scientific article; zbMATH DE number 432839

MaRDI QIDQ3138973zbMATH OpenFDO

Authors Tze-Heng Ma, Jeremy P. Spinrad

Publication date 20 October 1993

zbMATH Keywords

poset dimensionchain subgraph cover

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Combinatorics of partially ordered sets (06A07)

Cited in

(8)

• Computation of inverse 1-center location problem on the weighted trapezoid graphs
• How to use the minimal separators of a graph for its chordal triangulation
• An \(O(n^3)\) time algorithm for recognizing threshold dimension 2 graphs
• Unrestricted and complete breadth-first search of trapezoid graphs in O(n) time
• Measuring the vulnerability for classes of intersection graphs
• Triangulating multitolerance graphs
• Doubly lexical ordering of dense 0--1 matrices
• Partial orders and their convex subsets

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 Q3138973)