9842 search results - page 409 / 1969 » The Complexity of the Matching-Cut Problem |
145
Voted
GEOINFO
2003
15 years 6 months ago
2003
Planning and optimizing urban traffic is a difficult problem, with considerable economic and social impacts. The development of suitable software tools to aid municipal governments...
132
click to vote
SODA
2004
ACM
15 years 6 months ago
2004
ACM
The (axis-parallel) stabbing number of a given set of line segments is the maximum number of segments that can be intersected by any one (axis-parallel) line. We investigate probl...
141
click to vote
JCS
2008
15 years 4 months ago
2008
The secrecy problem for security protocols is the problem to decide whether or not a given security protocol has leaky runs. In this paper, the (initial) secrecy problem for bound...
135
click to vote
TKDE
2008
15 years 4 months ago
2008
Schema matching is one of the key challenges in information integration. It is a labor-intensive and time-consuming process. To alleviate the problem, many automated solutions have...
126
click to vote
ATMOS
2010
15 years 3 months ago
2010
We study variants of the vertex disjoint paths problem in planar graphs where paths have to be selected from a given set of paths. We study the problem as a decision, maximization...