scientific article; zbMATH DE number 432839
From MaRDI portal
Publication:3138973
zbMATH Open0800.68606MaRDI QIDQ3138973FDOQ3138973
Jeremy P. Spinrad, Tze-Heng Ma
Publication date: 20 October 1993
Title of this publication is not available (Why is that?)
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)
