Paper Info
Title
Cycles of prescribed modularity in planar digraphs
Abstract
We present a polynomial-time algorithm to find out whether all directed cycles in a directed planar graph are of lengthpmodq, with 0≤p<q.
Year
DOI
Venue
1993
10.1006/jagm.1996.0036
Journal of Algorithms
Keywords
DocType
Volume
planar digraph,prescribed modularity
Conference
21
Issue
ISSN
Citations 
1
0196-6774
3
PageRank 
References 
Authors
0.44
2
2
Name
Order
Citations
PageRank
Anna Galluccio119323.05
Martin Loebl215228.66