505 search results - page 18 / 101 » On A Graph Formalism for Ordered Edges |
100
Voted
EDBT
2010
ACM
15 years 28 days ago
2010
ACM
A key advantage of scientific workflow systems over traditional scripting approaches is their ability to automatically record data and process dependencies introduced during workf...
120
click to vote
SIAMCOMP
2011
14 years 13 days ago
2011
We consider the problem of testing graph expansion (either vertex or edge) in the bounded degree model [10]. We give a property tester that given a graph with degree bound d, an ex...
75
Voted
AVI
2006
14 years 11 months ago
2006
This methodological note focuses on the edge density of real world examples of networks. The edge density is a parameter of interest typically when putting up user studies in an e...
90
Voted
DM
2006
14 years 9 months ago
2006
For a chordal graph G = (V, E), we study the problem of whether a new vertex u V and a given set of edges between u and vertices in V can be added to G so that the resulting grap...
VIS
2006
IEEE
15 years 11 months ago
2006
IEEE
Accurately representing higher-order singularities of vector fields defined on piecewise linear surfaces is a non-trivial problem. In this work, we introduce a concise yet complet...