4009 search results - page 110 / 802 » Clustering on Complex Graphs |
169
click to vote
BIBE
2005
IEEE
15 years 9 months ago
2005
IEEE
In this article we present novel preprocessing techniques, based on topological measures of the network, to identify clusters of proteins from Protein-protein interaction (PPI) ne...
167
click to vote
KIVS
2011
Springer
14 years 6 months ago
2011
Springer
Localized geographic single path routing along a wireless network graph requires exact location information about the network nodes to assure message delivery guarantees. Node loc...
150
click to vote
WG
2009
Springer
15 years 10 months ago
2009
Springer
We present a fully dynamic algorithm that maintains three different representations of an interval graph: a minimal interval model of the graph, the PQ-tree of its maximal cliques...
132
click to vote
COMPGEOM
2004
ACM
15 years 9 months ago
2004
ACM
We prove that the geometric thickness of graphs whose maximum degree is no more than four is two. In our proofs, we present a space and time efficient embedding technique for gra...