871 search results - page 34 / 175 » The vertex-cover polynomial of a graph |
SODA
1998
ACM
14 years 11 months ago
1998
ACM
Given a planar graph on n nodes with costs weights on its edges, de ne the distance between nodes i and j as the length of the shortest path between i and j. Consider this as an i...
IWOCA
2009
Springer
15 years 4 months ago
2009
Springer
MLG
2007
Springer
15 years 3 months ago
2007
Springer
78
Voted
FOCS
1995
IEEE
15 years 1 months ago
1995
IEEE
70
Voted
ICDT
2010
ACM
15 years 3 days ago
2010
ACM
