Skip to content
cs-conference-ranking
.org
By subfield
By rank
Methodology
⌕
Search 971 venues
Home
/
STACS
/
Paper
A Polynomial Time Algorithm for Minimum Cycle Basis in Directed Graphs.
Telikepalli Kavitha
,
Kurt Mehlhorn
Venue
A
STACS
Year
2005
Proceedings
STACS
DBLP record
conf/stacs/KavithaM05 ↗
Browse the full
STACS paper archive
.