6740 search results - page 349 / 1348 » An s -Hamiltonian Line Graph Problem |
193
click to vote
FOCS
2000
IEEE
15 years 8 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...
139
click to vote
FCS
2006
15 years 5 months ago
2006
The problem of finding a negative cycle in a weighted, directed graph is discussed here. First the algorithm for printing out a negative cycle reachable from the source s, with th...
147
click to vote
AUTOMATICA
2008
15 years 4 months ago
2008
Graph matching is a fundamental problem that arises frequently in the areas of distributed control, computer vision, and facility allocation. In this paper, we consider the optimal...
127
Voted
ISCC
2006
IEEE
15 years 10 months ago
2006
IEEE
Rectangular dualization is an effective, hierarchically oriented visualization method for network topologies and can be used in many other problems having in common with networks ...
126
click to vote
ACSC
2003
IEEE
15 years 9 months ago
2003
IEEE
The ability for multiple threads to enter the same graph node without contention and conflict is a necessary component of the graph reduction of functional languages since graph c...