218 search results - page 10 / 44 » Local Properties of Triangular Graphs |
ICS
2010
Tsinghua U.
14 years 4 months ago
2010
Tsinghua U.
: We initiate the study of local, sublinear time algorithms for finding vertices with extreme topological properties -- such as high degree or clustering coefficient -- in large so...
SIROCCO
2007
13 years 9 months ago
2007
The focus of the present paper is on providing a local deterministic algorithm for colouring the edges of Yao-like subgraphs of Unit Disc Graphs. These are geometric graphs such t...
TSMC
1998
13 years 7 months ago
1998
: This paper presents a procedure for automatically drawing directed graphs. Our system, CG, uses a unique clan-based graph decomposition to determine intrinsic substructures (clan...
ICML
2010
IEEE
13 years 8 months ago
2010
IEEE
Existing approaches to analyzing the asymptotics of graph Laplacians typically assume a well-behaved kernel function with smoothness assumptions. We remove the smoothness assumpti...
GG
2010
Springer
13 years 8 months ago
2010
Springer
Abstract. Local confluence is an important property in many rewriting and transformation systems. The notion of critical pairs is central for being able to verify local confluence ...