5473 search results - page 704 / 1095 » On the graph isomorphism problem |
196
click to vote
ICCSA
2007
Springer
16 years 28 days ago
2007
Springer
Abstract. Determining whether two segments s and t in a planar polygonal scene weakly see each other is a classical problem in computational geometry. In this problem we seek for a...
214
click to vote
APPROX
2005
Springer
16 years 9 days ago
2005
Springer
We study the partial vertex cover problem. Given a graph G = (V, E), a weight function w : V → R+ , and an integer s, our goal is to cover all but s edges, by picking a set of v...
210
click to vote
CP
2003
Springer
16 years 3 hour ago
2003
Springer
Abstract. Many real world problems, e.g. personnel scheduling and transportation planning, can be modeled naturally as Constrained Shortest Path Problems (CSPPs), i.e., as Shortest...
251
click to vote
FOCS
1997
IEEE
15 years 11 months ago
1997
IEEE
We introduce a new approach to the maximum flow problem. This approach is based on assigning arc lengths based on the residual flow value and the residual arc capacities. Our appro...
160
click to vote
FOCS
2004
IEEE
15 years 10 months ago
2004
IEEE
The Metric Labeling problem is an elegant and powerful mathematical model capturing a wide range of classification problems. The input to the problem consists of a set of labels a...