Space-efficient counting in graphs on surfaces

DOI10.1007/s00037-009-0266-4zbMath1205.05215OpenAlexW1977227483MaRDI QIDQ626667

Mark Braverman, Sambuddha Roy, Raghav Kulkarni

Publication date: 18 February 2011

Published in: Computational Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00037-009-0266-4

zbMATH Keywords

planar graphscountingnumber of spanning treesproblem complexity

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Enumeration in graph theory (05C30) Relations of low-dimensional topology with graph theory (57M15) Graph algorithms (graph-theoretic aspects) (05C85)

This page was built for publication: Space-efficient counting in graphs on surfaces