scientific article
From MaRDI portal
Publication:3670598
zbMath0521.68081MaRDI QIDQ3670598
Jacobo Valdes, Jeremy P. Spinrad
Publication date: 1983
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Partial orders, general (06A06) Graph theory (including graph drawing) in computer science (68R10) Directed graphs (digraphs), tournaments (05C20) Discrete mathematics in relation to computer science (68R99)
Related Items (13)
Circular-arc graphs with clique cover number two ⋮ A \(k\)-structure generalization of the theory of 2-structures ⋮ A recognition algorithm for orders of interval dimension two ⋮ A compact data structure and parallel algorithms for permutation graphs ⋮ A simpler linear-time recognition of circular-arc graphs ⋮ A tight lower bound for primitivity in k-structures ⋮ Transitive closure for restricted classes of partial orders ⋮ Characterization and complexity of uniformly nonprimitive labeled 2-structures ⋮ Parallel interval order recognition and construction of interval representations ⋮ \(P_ 4\)-trees and substitution decomposition ⋮ \(O(m\log n)\) split decomposition of strongly-connected graphs ⋮ O(m logn) Split Decomposition of Strongly Connected Graphs ⋮ Modular decomposition and transitive orientation
This page was built for publication:
