2503 search results - page 93 / 501 » A study of 3-arc graphs |
157
click to vote
IPPS
2008
IEEE
16 years 16 days ago
2008
IEEE
We present SNAP (Small-world Network Analysis and Partitioning), an open-source graph framework for exploratory study and partitioning of large-scale networks. To illustrate the c...
188
click to vote
SIGMOD
2011
ACM
14 years 9 months ago
2011
ACM
We consider extending decision support facilities toward large sophisticated networks, upon which multidimensional attributes are associated with network entities, thereby forming...
182
Voted
ISSTA
2009
ACM
16 years 19 days ago
2009
ACM
Bug localization has attracted a lot of attention recently. Most existing methods focus on pinpointing a single statement or function call which is very likely to contain bugs. Al...
124
click to vote
COMBINATORICS
1999
15 years 5 months ago
1999
An orthogonal coloring of a graph G is a pair {c1, c2} of proper colorings of G, having the property that if two vertices are colored with the same color in c1, then they must hav...
163
click to vote
STOC
2005
ACM
16 years 6 months ago
2005
ACM
Understanding the graph structure of the Internet is a crucial step for building accurate network models and designing efficient algorithms for Internet applications. Yet, obtaini...