335 search results - page 41 / 67 » How to Use Spanning Trees to Navigate in Graphs |
161
click to vote
SMI
2005
IEEE
15 years 11 months ago
2005
IEEE
For time-dependent scalar fields, one is often interested in topology changes of contours in time. In this paper, we focus on describing how contours split and merge over a certa...
199
click to vote
IWPEC
2009
Springer
16 years 21 days 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...
178
click to vote
CP
2005
Springer
15 years 8 months ago
2005
Springer
Boolean Constraint Propagation (BCP) is recognized as one of the most useful technique for efficient satisfiability checking. In this paper a new extension of the scope of boole...
146
click to vote
CORR
1999
Springer
15 years 5 months ago
1999
Springer
In recent work we have presented a formal framework for linguistic annotation based on labeled acyclic digraphs. These `annotation graphs' oer a simple yet powerful method fo...
162
click to vote
CIKM
2007
Springer
16 years 10 days ago
2007
Springer
XML query languages typically allow the specification of structural patterns of elements. Finding the occurrences of such patterns in an XML tree is the key operation in XML quer...