Recognizing Polymatroids Associated with Hypergraphs

DOI10.1017/S0963548300000882zbMath0793.05045OpenAlexW2144551932MaRDI QIDQ4290102

Dirk Vertigan, Geoffrey P. 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

algorithmhypergraphspolymatroidspolynomial timegraphic matroidsBoolean polymatroidshypergraphic polymatroids

Mathematics Subject Classification ID

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

Related Items (1)

FPT Suspects and Tough Customers: Open Problems of Downey and Fellows

Cites Work

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

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