4009 search results - page 166 / 802 » Clustering on Complex Graphs |
128
click to vote
PCI
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. Graphs are useful data structures capable of efficiently representing a variety of technological and social networks. They are therefore utilized in simulation-based stud...
145
click to vote
COCOON
1999
Springer
15 years 8 months ago
1999
Springer
Abstract. Hierarchical graphs are an important class of graphs for modelling many real applications in software and information visualization. In this paper, we shall investigate t...
121
click to vote
FSTTCS
2008
Springer
15 years 5 months ago
2008
Springer
We consider the isomorphism and canonization problem for 3-connected planar graphs. The problem was known to be L -hard and in UL ∩ coUL [TW08]. In this paper, we give a determin...
161
click to vote
CORR
2008
Springer
15 years 4 months ago
2008
Springer
We relate the graph isomorphism problem to the solvability of certain systems of linear equations and linear inequalities. The number of these equations and inequalities is relate...
141
click to vote
PDP
2006
IEEE
15 years 10 months ago
2006
IEEE
We explore the possibilities to organize a query data structure in the main memories or hard disks of a cluster computer. The query data structure serves to improve the performanc...