Searching for "Computing the Girth of a Planar Graph." – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

2 documents found, showing 1 through 2.

Computing the Girth of a Planar Graph
by Hristo N. Djidjev — 2000 — In Proc. 27th International Colloquium on Automata, Languages and Programming ICALP 2000, volume 1853 of LNCS
…Computing the Girth of a Planar Graph ? Hristo N. Djidjev 1 Department of Computer Science…
Cited by 3 (0 self) – Add To MetaCart

Shortest path queries in planar graphs in constant time
by Łukasz Kowalik — 2003 — In STOC’03
… whether a given graph has girth at most k and if so it computes the corresponding shortest cycle. 1…
Cited by 3 (2 self) – Add To MetaCart

Showing 1 through 2.

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB