Pith. sign in

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.

Re-run · record.json Download PDF Read on arXiv ↗

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

arxiv 1004.4484 v1 pith:ZTRJYAQU submitted 2010-04-26 cs.DM math.CO

Viresh Patel This is my paper · ORCID
classification cs.DMmath.CO
keywords edgeconnectivityexpansiongenusmeasuresotherboundeddetermined
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
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.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Finding Regions of Maximum Circularity in Plane Geometric Graphs

    cs.DS 2026-07 accept novelty 7.0 of 10

    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.

Pith tools