Mod/Resc parsimony inference: theory and application

DOI10.1016/j.ic.2011.03.008zbMath1237.92041OpenAlexW2092636529MaRDI QIDQ418168

Danny Hermelin, Jan Engelstadter, Igor Nor, Marie-France Sagot, Max Reuter, Sylvain Charlat, Olivier Duron

Publication date: 24 May 2012

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ic.2011.03.008

zbMATH Keywords

bipartite graphgraph theoryNP-completenesscomputational biologyBoolean matrixfixed-parameter tractabilitybiclique edge coveringkernelisation

Mathematics Subject Classification ID

Applications of graph theory (05C90) Complexity and performance of numerical algorithms (65Y20) Medical epidemiology (92C60)

Related Items (3)

Unnamed Item ⋮ On some FPT problems without polynomial Turing compressions ⋮ Efficient approximation for restricted biclique cover problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Covering graphs with few complete bipartite subgraphs
• On covering graphs by complete bipartite subgraphs
• Parametrized complexity theory.
• A New Algorithm for Generating All the Maximal Independent Sets
• Data reduction and exact algorithms for clique cover
• Inapproximability of Nondeterministic State and Transition Complexity Assuming P ≠ NP
• Bicliques in graphs. I: Bounds on their number

This page was built for publication: Mod/Resc parsimony inference: theory and application