813 search results - page 43 / 163 » On the Boolean-Width of a Graph: Structure and Applications |
167
click to vote
ALGORITHMICA
2010
15 years 6 months ago
2010
Given a 2k-edge-connected undirected graph, we consider to find a minimum cost orientation that yields a k-arc-connected directed graph. This minimum cost k-arc-connected orientat...
148
click to vote
APVIS
2008
15 years 7 months ago
2008
We propose a method to visually summarize collections of networks on which a clustering of the vertices is given. Our method allows for efficient comparison of individual networks...
166
click to vote
GBRPR
2009
Springer
15 years 3 months ago
2009
Springer
In this paper, we present a novel graph construction method and demonstrate its usage in a broad range of applications starting from a relatively simple single-surface segmentation...
175
click to vote
CIKM
2009
Springer
15 years 10 months ago
2009
Springer
We study query processing in large graphs that are fundamental data model underpinning various social networks and Web structures. Given a set of query nodes, we aim to find the g...
140
click to vote
KRDB
1998
15 years 7 months ago
1998
Previous researchers note the problem for semantic optimisation of database queries caused by its production of a large number of semantically equivalent alternative queries, from...