REVIEW 1 cited by
Determining Edge Expansion and Other Connectivity Measures of Graphs of Bounded Genus
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Determining Edge Expansion and Other Connectivity Measures of Graphs of Bounded Genus
read the original abstract
In this paper, we show that for an $n$-vertex graph $G$ of genus $g$, the edge expansion of $G$ can be determined in time $n^{O(g^2)}$. We show that the same is true for various other similar measures of edge connectivity.
Forward citations
Cited by 1 Pith paper
-
Finding Regions of Maximum Circularity in Plane Geometric Graphs
Maximizing A/P^α over unions of faces in a plane subdivision is weakly NP-hard for α in (1,2] and solvable in pseudopolynomial time for all α>1.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.