6740 search results - page 171 / 1348 » An s -Hamiltonian Line Graph Problem |
136
click to vote
APPML
2006
15 years 6 months ago
2006
The purpose of the paper is to provide an answer to a long standing problem to compute the distance distribution among the nodes in a star graph, i.e., to compute the exact number...
155
click to vote
ALGORITHMICA
2006
15 years 6 months ago
2006
We present a cubic-time algorithm for the following problem: Given a simple graph, decide whether it is realized by adjacencies of countries in a map without holes, in which at mo...
168
click to vote
COMBINATORICS
2000
15 years 6 months ago
2000
The question of whether the characteristic polynomial of a simple graph is uniquely determined by the characteristic polynomials of its vertex-deleted subgraphs is one of the many...
147
click to vote
SAC
2009
ACM
16 years 1 months ago
2009
ACM
The Problem Frames approach captures problems as seen by developers, but not by stakeholders. This paper presents a framework that extends the problem diagram of the Problem Frame...
179
click to vote
ICIP
2010
IEEE
15 years 4 months ago
2010
IEEE
In few years, graph cuts have become a leading method for solving a wide range of problems in computer vision. However, graph cuts involve the construction of huge graphs which so...