1736 search results - page 63 / 348 » The rank-width of Directed Graphs |
123
click to vote
VMV
2001
15 years 5 months ago
2001
Computational steering requires the coupling of simulation and visualization elements, but if the latter is targetted at general requirements, little or no information about the c...
166
click to vote
FSTTCS
2001
Springer
15 years 8 months 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...
130
click to vote
EWHCI
1995
15 years 7 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...
149
click to vote
VL
1995
IEEE
15 years 7 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...
117
click to vote
PC
2000
15 years 3 months ago
2000
Three parallel optimisation algorithms for use in the context of multilevel graph partitioning for unstructured meshes are described. The first, interface optimisation reduces the...