Counting independent sets in graphs with bounded bipartite pathwidth

From MaRDI portal
Revision as of 09:33, 10 July 2024 by Import240710060729 (talk | contribs) (Created automatically from import240710060729)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:6310891


DOI10.1007/978-3-030-30786-8_23arXiv1812.03195MaRDI QIDQ6310891

Catherine Greenhill, Martin Dyer, Haiko Müller

Publication date: 7 December 2018



Mathematics Subject Classification ID

68R10: Graph theory (including graph drawing) in computer science

05C30: Enumeration in graph theory

05C85: Graph algorithms (graph-theoretic aspects)

05C69: Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)

68W25: Approximation algorithms

68W20: Randomized algorithms





Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:6310891&oldid=35896742"
Powered by MediaWiki