Simultaneous dominance representation of multiple posets

DOI10.1007/BF00405594zbMATH Open0873.06003MaRDI QIDQ1362580FDOQ1362580

Authors: Paul J. Tanenbaum, Sue Whitesides 

Publication date: 5 August 1997

Published in: Order (Search for Journal in Brave)

Recommendations

• The simultaneous representation problem for chordal, comparability and permutation graphs
• The solution of two problems on bound polysemy
• Parity representations of posets
• The Simultaneous Representation Problem for Chordal, Comparability and Permutation Graphs
• Poset matrix and recognition of series-parallel posets

zbMATH Keywords

recognition algorithmcodominance pairsdominance polysemy

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Combinatorics of partially ordered sets (06A07)

Cites Work

• Title not available (Why is that?)
• A Characterization of Comparability Graphs and of Interval Graphs
• Partially Ordered Sets
• Graph drawing. DIMACS international workshop, GD '94, Princeton, NJ, USA, October 10-12, 1994. Proceedings
• Recognition of Circle Graphs
• Representations of Planar Graphs
• Intersection graphs of curves in the plane
• Title not available (Why is that?)
• Semispaces of configurations, cell complexes of arrangements
• On the combinatorial classification of nondegenerate configurations in the plane
• A Note on Planar Graphs and Circle Orders
• Angle orders
• Sphere orders
• Simultaneous representation of interval and interval-containment orders

Cited In (3)

• Title not available (Why is that?)
• Dominance and separability in posets, their application to isoelectronic species with equal total nuclear charge
• Simultaneous representation of interval and interval-containment orders

This page was built for publication: Simultaneous dominance representation of multiple posets

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