scientific article; zbMATH DE number 3512137

MaRDI QIDQ4091971zbMATH OpenFDO

Authors Michel Lorea

Publication date 1975

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35) Graph theory (05C99)

Cited in

(15)

• Sparse hypergraphs and pebble game algorithms
• On Turan hypergraphs
• On decomposing a hypergraph into \(k\) connected sub-hypergraphs
• Computing minimum multiway cuts in hypergraphs
• Packing of mixed hyperarborescences with flexible roots via matroid intersection
• On some algorithmic aspects of hypergraphic matroids
• Reachability in arborescence packings
• Packing Steiner trees
• A Survey on Covering Supermodular Functions
• Shorter tours by nicer ears: 7/5-approximation for the graph-TSP, 3/2 for the path version, and 4/3 for two-edge-connected subgraphs
• Strong algorithms for the ordinal matroid secretary problem
• Steiner connectivity problems in hypergraphs
• Hypertree shrinking avoiding low degree vertices
• Packing mixed hyperarborescences
• An algorithm for packing hypertrees

This page was built for publication:

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