A parameterized algorithm for chordal sandwich

DOI10.1007/978-3-642-13073-1_12zbMATH Open1200.05226OpenAlexW1580958812MaRDI QIDQ3562997FDOQ3562997

Authors: Pinar Heggernes, F. Mancini, Jesper Nederlof, Yngve Villanger 

Publication date: 28 May 2010

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-13073-1_12

Recommendations

• Tractability of Parameterized Completion Problems on Chordal, Strongly Chordal, and Proper Interval Graphs
• Faster Parameterized Algorithms for Minimum Fill-In
• Chordal deletion is fixed-parameter tractable
• The chain graph sandwich problem
• Faster parameterized algorithms for \textsc{Minimum Fill-in}

zbMATH Keywords

sparse matrix computation

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Graph algorithms (graph-theoretic aspects) (05C85)

Cited In (5)

• The complexity of forbidden subgraph sandwich problems and the skew partition sandwich problem
• Title not available (Why is that?)
• Finding optimal triangulations parameterized by edge clique cover
• Treewidth and pathwidth parameterized by the vertex cover number
• How good is the Chord algorithm?

This page was built for publication: A parameterized algorithm for chordal sandwich

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