A linear-time algorithm for the minimum degree hypergraph problem with the consecutive ones property

DOI10.1007/978-3-642-38768-5_25MaRDI QIDQ4925244zbMATH OpenOpenAlexFDO

Authors Chih-Hsuan Li, Jhih-Hong Ye, Biing-Feng Wang

Publication date 11 June 2013

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-38768-5_25

Mathematics Subject Classification ID

Hypergraphs (05C65) Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms (68W40)

Recommendations

• On the minimum degree hypergraph problem with subset size two and the red-blue set cover problem with the consecutive ones property
• An improved algorithm for the red-blue hitting set problem with the consecutive ones property
• scientific article; zbMATH DE number 3910436
• Identifying the Minimal Transversals of a Hypergraph and Related Problems
• Solution of one problem of optimal partition of the vertex set of a hypergraph

Cited in

(1)

• On the minimum degree hypergraph problem with subset size two and the red-blue set cover problem with the consecutive ones property

This page was built for publication: A linear-time algorithm for the minimum degree hypergraph problem with the consecutive ones property

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