4926 search results - page 144 / 986 » Two Graph Algorithms On an Associative Computing Model |
207
click to vote
FOCS
2000
IEEE
15 years 9 months ago
2000
IEEE
A bisection of a graph with n vertices is a partition of its vertices into two sets, each of size n/2. The bisection cost is the number of edges connecting the two sets. The proble...
177
Voted
ICCS
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. This work takes place in the general context of the construction and validation of a domain expertise. It aims at the cooperation of two kinds of knowledge, heterogeneous...
138
click to vote
GD
2006
Springer
15 years 8 months ago
2006
Springer
We consider the problem of intersection-free planar graph morphing, and in particular, a generalization from Euclidean space to spherical space. We show that there exists a continu...
156
click to vote
CSL
2003
Springer
15 years 10 months ago
2003
Springer
Many verification, planning, and control problems can be modeled as games played on state-transition graphs by one or two players whose conflicting goals are to form a path in th...
174
Voted
DAM
1999
15 years 4 months ago
1999
Several graph problems (e.g., steiner tree, connected domination, hamiltonian path, and isomorphism problem), which can be solved in polynomial time for distance-hereditary graphs...