A Parameterized Algorithm for Chordal Sandwich

DOI10.1007/978-3-642-13073-1_12zbMath1200.05226OpenAlexW1580958812MaRDI QIDQ3562997

Federico Mancini, Jesper Nederlof, Yngve Villanger, Pinar Heggernes

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

zbMATH Keywords

sparse matrix computation

Mathematics Subject Classification ID

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

Related Items (4)

Treewidth and pathwidth parameterized by the vertex cover number ⋮ Finding optimal triangulations parameterized by edge clique cover ⋮ Unnamed Item ⋮ The complexity of forbidden subgraph sandwich problems and the skew partition sandwich problem

This page was built for publication: A Parameterized Algorithm for Chordal Sandwich