6740 search results - page 81 / 1348 » An s -Hamiltonian Line Graph Problem |
125
click to vote
DAM
1999
15 years 2 months ago
1999
We consider a search game on a graph in which one cop in a helicopter flying from vertex to vertex tries to catch the invisible robber. The existence of the winning program for th...
112
click to vote
CCCG
2003
15 years 4 months ago
2003
Suppose one has a line arrangement and one wants to find a shortest path from one point lying on a line of the arrangement to another such point. We look at a special case: the a...
172
click to vote
COCOON
2004
Springer
15 years 8 months ago
2004
Springer
The problem of efficiently monitoring the network flow is regarded as the one to find out the minimum weighted weak vertex cover set for a given graph G = (V, E) with weight func...
148
Voted
AIME
2009
Springer
15 years 9 months ago
2009
Springer
Note taking is a common way for physicians to collect information from their patients in medical inquiries and diagnoses. Many times, when describing the pathology in medical recor...
105
click to vote
ICALP
2007
Springer
15 years 9 months ago
2007
Springer
Register allocation is NP-complete in general but can be solved in linear time for straight-line programs where each variable has at most one definition point if the bank of regis...