CYCLES OF PRESCRIBED MODULARITY IN PLANAR DIGRAPHS

Authors
GALLUCCIO A LOEBL M
Citation
A. Galluccio et M. Loebl, CYCLES OF PRESCRIBED MODULARITY IN PLANAR DIGRAPHS, Journal of algorithms, 21(1), 1996, pp. 51-70
Citations number
6
Categorie Soggetti
Mathematics,Mathematics,"Computer Science Theory & Methods
Journal title
Journal of algorithms → ACNP
ISSN journal
01966774
Volume
21
Issue
1
Year of publication
1996
Pages
51 - 70
Database
ISI
SICI code
0196-6774(1996)21:1<51:COPMIP>2.0.ZU;2-G
Abstract
We present a polynomial-time algorithm to find out whether all directe d cycles in a directed planar graph are of length p mod q, with 0 less than or equal to p < q. (C) 1996 Academic Press, Inc.