1402 search results - page 39 / 281 » Searching Cycle-Disjoint Graphs |
151
click to vote
CONSTRAINTS
2010
15 years 6 months ago
2010
Abstract. We present three constraint models of the problem of finding a graceful labelling of a graph, or proving that the graph is not graceful. An experimental comparison of the...
176
click to vote
DAM
2000
15 years 5 months ago
2000
Feedback problems consist of removing a minimal number of vertices of a directed or undirected graph in order to make it acyclic. The problem is known to be NPcomplete. In this pa...
159
click to vote
APVIS
2007
15 years 7 months ago
2007
Graphs are typically visualized as node-link diagrams. Although there is a fair amount of research focusing on crossing minimization to improve readability, little attention has b...
153
click to vote
CLEF
2010
Springer
15 years 7 months ago
2010
Springer
In the third edition of WePS campaign we have undertaken the person name disambiguation problem referred to as a clustering task. Our aim was to make use of intrinsic link relation...
163
click to vote
PVLDB
2010
15 years 4 months ago
2010
The dramatic proliferation of sophisticated networks has resulted in a growing need for supporting effective querying and mining methods over such large-scale graph-structured da...