The Assignable Subgraph Polytope of a Directed Graph.
Management science research rept.,
CARNEGIE-MELLON UNIV PITTSBURGH PA MANAGEMENT SCIENCES RESEARCH GROUP
Pagination or Media Count:
Given a directed graph, its assignable subgraph polytope is the convex hull of incidence vectors of subgraphs that have an assignment. Based on earlier results of Balas and Pulleyblank, given a linear characterization of the assignable subgraph polytope of an arbitrary digraph. As a byproduct, the author also characterizes the s-t path decomposable subgraph polytope of an acyclic digraph. Keywords Assignment Cycle decomposition Path decomposition Matching.
- Numerical Mathematics