Recognizing Polymatroids Associated with Hypergraphs

DOI10.1017/S0963548300000882zbMATH Open0793.05045OpenAlexW2144551932MaRDI QIDQ4290102FDOQ4290102

Geoff Whittle, Dirk Vertigan

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)

Cites Work

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

Cited In (4)

• Excluded minors for Boolean polymatroids
• Title not available (Why is that?)
• Recognizing hyperelliptic graphs in polynomial time
• FPT Suspects and Tough Customers: Open Problems of Downey and Fellows

Recommendations

• On some algorithmic aspects of hypergraphic matroids 👍 👎
• Characterizing and recognizing generalized polymatroids 👍 👎
• Polymatroids: Construction and random algorithms 👍 👎
• Some excluded-minor theorems for a class of polymatroids 👍 👎
• Recognition Algorithms for Binary Signed-Graphic Matroids 👍 👎

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)