Skip to content
cs-conference-ranking
.org
By subfield
By rank
Methodology
⌕
Search 971 venues
Home
/
ICALP
/
Paper
The Lexicographically First Maximal Subgraph Problems: P-Completeness and NC Algorithms.
Satoru Miyano
Venue
A*
ICALP
Year
1987
Proceedings
ICALP
DBLP record
conf/icalp/Miyano87 ↗
Browse the full
ICALP paper archive
.