1756 search results - page 52 / 352 » Directed scale-free graphs |
MFCS
2010
Springer
13 years 6 months ago
2010
Springer
Abstract. We address the strategy problem for parity games with partial information and observable colors, played on finite graphs of bounded graph complexity. We consider several...
FSTTCS
2001
Springer
14 years 11 days ago
2001
Springer
Consider a directed graph G = (V, E) with n vertices and a root vertex r ∈ V . The DMDST problem for G is one of constructing a spanning tree rooted at r, whose maximal degree is...
EWHCI
1995
13 years 11 months ago
1995
Diagrams (e.g., trees for hierarchical structures, or graphs for finite state machines) are often needed as part of advanced user interfaces, and are frequently specific to a use...
VL
1995
IEEE
13 years 11 months ago
1995
IEEE
Diagrams (e.g., flowcharts, trees for hierarchical structures, or graphs for finite state machines) are often needed as part of visual language systems and advanced user interfa...
GBRPR
2003
Springer
14 years 1 months ago
2003
Springer
Abstract. We present a new method (MIDES) to determine contraction kernels for the construction of graph pyramids. Experimentally the new method has a reduction factor higher than ...