Adjacency of vertices of the complete pre-order polytope

DOI10.1016/S0012-365X(96)00143-4zbMath0886.05107MaRDI QIDQ1377754

Yoshiko Wakabayashi, Maria Angela C. M. Gurgel

Publication date: 26 January 1998

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

zbMATH Keywords

digraphdiameterpolytopeconvex hulladjacency relationcomplete pre-order

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Partial orders, general (06A06) Graph theory (including graph drawing) in computer science (68R10) Graph theory (05C99) Directed graphs (digraphs), tournaments (05C20)

Related Items (2)

Weak order polytopes. ⋮ Multiprocessor scheduling under precedence constraints: polyhedral results

Cites Work

• Parallel concepts in graph theory
• The travelling salesman problem and a class of polyhedra of diameter two
• The adjacency relation on the traveling salesman polytope is NP-Complete
• Polytopes, graphs, and complexes
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Adjacency of vertices of the complete pre-order polytope