Path-closed sets

DOI10.1007/BF02579138zbMATH Open0559.05034OpenAlexW1966224291MaRDI QIDQ802569FDOQ802569

Authors: Heinz Groeflin 

Publication date: 1984

Published in: Combinatorica (Search for Journal in Brave)

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

Recommendations

• scientific article; zbMATH DE number 3910419
• A New Algorithm for Computing the Maximal Closure of a Graph
• Disjoint \(A\)-paths in digraphs
• Finding a maximum-weight convex set in a chordal graph
• On finite convexity spaces induced by sets of paths in graphs

zbMATH Keywords

digraphpath-closed sets

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Blocking and anti-blocking pairs of polyhedra
• A decomposition theorem for partially ordered sets
• Matroids and the greedy algorithm
• On total dual integrality
• Anti-blocking polyhedra
• Total dual integrality and integer polyhedra
• A generalization of max flow—min cut
• Lattice Polyhedra II: Generalization, Constructions and Examples
• Title not available (Why is that?)

Cited In (7)

• Title not available (Why is that?)
• On switching paths polyhedra
• GLB-closures in directed acyclic graphs and their applications
• Finding a maximum-weight convex set in a chordal graph
• Lattice matrices, intersection of ring families and dicuts
• Optimum partitioning into intersections of ring families
• Switchdec polyhedra

This page was built for publication: Path-closed sets

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