Counting cycles on planar graphs in subexponential time
From MaRDI portal
Publication:6113852
DOI10.1007/978-3-031-22105-7_24arXiv2208.09948MaRDI QIDQ6113852
Publication date: 10 August 2023
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2208.09948
Related Items
Cites Work
- Random generation of combinatorial structures from a uniform distribution
- Finding small simple cycle separators for 2-connected planar graphs
- Reduced constants for simple cycle graph separation
- Efficient exact algorithms on planar graphs: Exploiting sphere cut decompositions
- Deterministic single exponential time algorithms for connectivity problems parameterized by treewidth
- A Separator Theorem for Planar Graphs
- Planar Separators
- Enumeration of the Elementary Circuits of a Directed Graph
- Finding All the Elementary Circuits of a Directed Graph
- An efficient search algorithm to find the elementary circuits of a graph
- Self-avoiding walks crossing a square
- Relations between hypersurface cross ratios, and a combinatorial formula for partitions of a polygon, for permanent preponderance, and for non-associative products
- Motzkin numbers
- Counting cycles on planar graphs in subexponential time
