Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

7

NETWORKS
2007

favoriteEmaildiscussreport

77views Computer Networks» more NETWORKS 2007»

A linear-time algorithm for the k-fixed-endpoint path cover problem on cographs

13 years 4 months ago

A linear-time algorithm for the k-fixed-endpoint path cover problem on cographs

Download www.cs.uoi.gr

Katerina Asdre, Stavros D. Nikolopoulos

Real-time Traffic

Computer Networks | NETWORKS 2007 |

claim paper

Related Content

» An Optimal Algorithm for the kFixedEndpoint Path Cover on Proper Interval Graphs

» Linear Time Solvable Optimization Problems on Graphs of Bounded Clique Width

» NearLinear Time Construction of Sparse Neighborhood Covers

» A polynomial solution to the kfixedendpoint path cover problem on proper interval graphs

» The Flow Set with Partial Order

Post Info
More Details (n/a)

Added	27 Dec 2010
Updated	27 Dec 2010
Type	Journal
Year	2007
Where	NETWORKS
Authors	Katerina Asdre, Stavros D. Nikolopoulos

Comments (0)