1402 search results - page 39 / 281 » Searching Cycle-Disjoint Graphs |
CONSTRAINTS
2010
14 years 10 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...
DAM
2000
14 years 9 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...
APVIS
2007
14 years 11 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...
CLEF
2010
Springer
14 years 11 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...
PVLDB
2010
14 years 8 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...