Computing the Girth of a Planar Graph in O(n logn) Time
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Computing the Girth of a Planar Graph in $O(n \logn)$ Time
SIAM Journal on Discrete Mathematics
Computing the girth of a planar graph in linear time
COCOON'11 Proceedings of the 17th annual international conference on Computing and combinatorics
The good, the bad, and the odd: cycles in answer-set programs
ESSLLI'10 Proceedings of the 2010 international conference on New Directions in Logic, Language and Computation
| Hi-index | 0.00 |