Adjacency of vertices of the complete pre-order polytope

DOI10.1016/S0012-365X(96)00143-4zbMATH Open0886.05107MaRDI QIDQ1377754FDOQ1377754

Authors: Maria Angela C. M. Gurgel, Yoshiko Wakabayashi 

Publication date: 26 January 1998

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

Recommendations

• A combinatorial study of partial order polytopes
• Adjacency on the order polytope with applications to the theory of fuzzy measures
• scientific article; zbMATH DE number 36207

zbMATH Keywords

convex hulldiameterpolytopedigraphadjacency relationcomplete pre-order

Mathematics Subject Classification ID

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

Cites Work

• Graph theory
• Parallel concepts in graph theory
• Title not available (Why is that?)
• Title not available (Why is that?)
• Polytopes, graphs, and complexes
• Title not available (Why is that?)
• The travelling salesman problem and a class of polyhedra of diameter two
• The adjacency relation on the traveling salesman polytope is NP-Complete
• Title not available (Why is that?)

Cited In (6)

• Polyhedral aspects of partial orders and comparability graphs
• Determining adjacent vertices on assignment polytopes
• Weak order polytopes.
• Adjacency on the order polytope with applications to the theory of fuzzy measures
• Multiprocessor scheduling under precedence constraints: polyhedral results
• Adjacencies on random ordering polytopes and flow polytopes

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

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