6740 search results - page 287 / 1348 » An s -Hamiltonian Line Graph Problem |
103
click to vote
IMCSIT
2010
14 years 8 months ago
2010
We formulate a novel problem of summarising entities with limited presentation budget on entity-relationship knowledge graphs and propose an efficient algorithm for solving this pr...
123
click to vote
ICCV
2003
IEEE
16 years 3 months ago
2003
IEEE
Vision tasks, such as segmentation, grouping, recognition, can be formulated as graph partition problems. The recent literature witnessed two popular graph cut algorithms: the Ncu...
ICDM
2009
IEEE
15 years 7 months ago
2009
IEEE
—In graph-based learning models, entities are often represented as vertices in an undirected graph with weighted edges describing the relationships between entities. In many real...
135
click to vote
IWPEC
2009
Springer
15 years 7 months ago
2009
Springer
Abstract. We introduce the graph parameter boolean-width, related to the number of different unions of neighborhoods across a cut of a graph. For many graph problems this number is...
119
click to vote
ISAAC
2004
Springer
15 years 6 months ago
2004
Springer
We study complexity and approximation of min weighted node coloring in planar, bipartite and split graphs. We show that this problem is NP-complete in planar graphs, even if they a...