On the Expressive Power of Permanents and Perfect Matchings of Matrices of Bounded Pathwidth/Cliquewidth (Extended Abstract)

DOI10.1007/978-3-540-79709-8_20zbMath1142.68350OpenAlexW1524394822MaRDI QIDQ3503637

Uffe Flarup, Laurent Lyaudet

Publication date: 5 June 2008

Published in: Computer Science – Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-79709-8_20

Mathematics Subject Classification ID

Related Items (1)

On the Expressive Power of Permanents and Perfect Matchings of Matrices of Bounded Pathwidth/Cliquewidth (Extended Abstract)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The complexity of computing the permanent
• \(k\)-NLC graphs and polynomial algorithms
• Upper bounds to the clique width of graphs
• On the Expressive Power of Permanents and Perfect Matchings of Matrices of Bounded Pathwidth/Cliquewidth (Extended Abstract)
• Compact Forbidden-Set Routing
• On the Relationship Between Clique-Width and Treewidth
• On the Expressive Power of Planar Perfect Matching and Permanents of Bounded Treewidth Matrices
• Characterizing Valiant’s Algebraic Complexity Classes
• On the fixed parameter complexity of graph enumeration problems definable in monadic second-order logic

This page was built for publication: On the Expressive Power of Permanents and Perfect Matchings of Matrices of Bounded Pathwidth/Cliquewidth (Extended Abstract)