6740 search results - page 90 / 1348 » An s -Hamiltonian Line Graph Problem |
MFCS
2004
Springer
14 years 3 months ago
2004
Springer
Abstract. Bidimensionality provides a tool for developing subexponential fixed-parameter algorithms for combinatorial optimization problems on graph families that exclude a minor....
COMPGEOM
2004
ACM
14 years 3 months ago
2004
ACM
Let P be a set of n points in Ê3 , not all in a common plane. We solve a problem of Scott (1970) by showing that the connecting lines of P assume at least 2n − 7 different dir...
CORR
2010
Springer
13 years 10 months ago
2010
Springer
We continue the line of research on graph compression started in [BV04], but we move our focus to the compression of social networks in a proper sense (e.g., LiveJournal): the app...
STOC
2003
ACM
14 years 10 months ago
2003
ACM
We show that n lines in 3-space can be cut into O(n2-1/69 log16/69 n) pieces, such that all depth cycles defined by triples of lines are eliminated. This partially resolves a long...
ICCS
2003
Springer
14 years 3 months ago
2003
Springer
We propose an anytime algorithm to compute successively better approximations of the optimum of Minimum Vertex Guard. Though the presentation is focused on polygons, the work may b...