Computing and Counting Longest Paths on Circular-Arc Graphs...

Electronic Notes in Discrete Mathematics 2011 Vol. 37; Iss. none

Computing and Counting Longest Paths on Circular-Arc Graphs in Polynomial Time

George B. Mertzios, Ivona Bezáková
How much do you like this book?
What’s the quality of the file?
Download the book for quality assessment
What’s the quality of the downloaded files?
Volume:
37
Year:
2011
Language:
english
Pages:
6
DOI:
10.1016/j.endm.2011.05.038
File:
PDF, 179 KB
english, 2011
Conversion to is in progress
Conversion to is failed