2503 search results - page 5 / 501 » A study of 3-arc graphs |
98
Voted
WG
2010
Springer
14 years 10 months ago
2010
Springer
The problem of determining the cutwidth of a graph is a notoriously hard problem which remains NP-complete under severe restrictions on input graphs. Until recently, non-trivial p...
102
click to vote
FCT
2009
Springer
15 years 6 months ago
2009
Springer
Entanglement is a complexity measure for directed graphs that was used to show that the variable hierarchy of the propositional modal µ-calculus is strict. While graphs of entangl...
76
Voted
IWPC
2000
IEEE
15 years 4 months ago
2000
IEEE
Software change requests are often formulated as requests to modify or to add a specific feature or concept. To implement these changes, the features or concepts must be located i...
101
click to vote
CHI
2009
ACM
16 years 7 days ago
2009
ACM
Graphs are often visualized using node-link representations: vertices are depicted as dots, edges are depicted as (poly)lines connecting two vertices. A directed edge running from...
94
Voted
IV
2002
IEEE
15 years 4 months ago
2002
IEEE
We describe AudioCave, an environment for exploring the impact of spatialising sonified graphs on a set of numerical data comprehension tasks. Its design builds on findings regard...