54 search results - page 5 / 11 » Navigation in degree of interest trees |
WAOA
2007
Springer
14 years 1 months ago
2007
Springer
For a connected graph G, let L(G) denote the maximum number of leaves in a spanning tree in G. The problem of computing L(G) is known to be NP-hard even for cubic graphs. We improv...
SODA
2012
ACM
11 years 9 months ago
2012
ACM
Given a class of graphs F, we say that a graph G is universal for F, or F-universal, if every H ∈ F is contained in G as a subgraph. The construction of sparse universal graphs ...
VIS
2004
IEEE
14 years 8 months ago
2004
IEEE
Coronary heart disease (CHD) is the number one killer in the United States. Although it is well known that CHD mainly occurs due to blocked arteries, there are contradictory resul...
CHI
2009
ACM
14 years 7 months ago
2009
ACM
We demonstrate how multi-touch hand gestures in combination with foot gestures can be used to perform navigation tasks in interactive systems. The geospatial domain is an interest...
PODS
2006
ACM
14 years 7 months ago
2006
ACM
Given a document D in the form of an unordered labeled tree, we study the expressibility on D of various fragments of XPath, the core navigational language on XML documents. We gi...