Path-closed sets

DOI10.1007/BF02579138zbMath0559.05034OpenAlexW1966224291MaRDI QIDQ802569

Heinz Groeflin

Publication date: 1984

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02579138

zbMATH Keywords

digraphpath-closed sets

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Paths and cycles (05C38) Directed graphs (digraphs), tournaments (05C20)

Related Items (5)

Optimum partitioning into intersections of ring families ⋮ Switchdec polyhedra ⋮ Lattice matrices, intersection of ring families and dicuts ⋮ On switching paths polyhedra ⋮ Finding a Maximum-Weight Convex Set in a Chordal Graph

Cites Work

• Unnamed Item
• Unnamed Item
• Total dual integrality and integer polyhedra
• On total dual integrality
• Anti-blocking polyhedra
• A decomposition theorem for partially ordered sets
• A generalization of max flow—min cut
• Lattice Polyhedra II: Generalization, Constructions and Examples
• Blocking and anti-blocking pairs of polyhedra
• Matroids and the greedy algorithm

This page was built for publication: Path-closed sets