Recognizing Polymatroids Associated with Hypergraphs

DOI10.1017/S0963548300000882MaRDI QIDQ4290102zbMATH OpenOpenAlexFDO

Authors Dirk Vertigan, Geoff Whittle

Publication date 28 April 1994

Published in Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1017/s0963548300000882

zbMATH Keywords

algorithmgraphic matroidshypergraphspolynomial timepolymatroidsBoolean polymatroidshypergraphic polymatroids

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35) Hypergraphs (05C65)

Recommendations

• On some algorithmic aspects of hypergraphic matroids
• Some excluded-minor theorems for a class of polymatroids
• Characterizing and recognizing generalized polymatroids
• Polymatroids: Construction and random algorithms
• Recognition algorithms for binary signed-graphic matroids

Cites work

• A geometric theory of hypergraph colouring
• An Algorithm for Determining Whether a Given Binary Matroid is Graphic
• Recognizing graphic matroids
• The computational complexity of matroid properties

Cited in

(8)

• Characterizing and recognizing generalized polymatroids
• On some algorithmic aspects of hypergraphic matroids
• Excluded minors for Boolean polymatroids
• scientific article; zbMATH DE number 3918383 (Why is no real title available?)
• scientific article; zbMATH DE number 942492 (Why is no real title available?)
• Recognizing hyperelliptic graphs in polynomial time
• Decomposable polymatroids and connections with graph coloring
• FPT Suspects and Tough Customers: Open Problems of Downey and Fellows

This page was built for publication: Recognizing Polymatroids Associated with Hypergraphs

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