Sciweavers

376 search results - page 23 / 76
» Completely connected clustered graphs
Sort
View
ISI
2007
Springer
14 years 1 months ago
Detecting Anomalies in Graphs
Graph data represents relationships, connections, or affinities. Innocent relationships produce repeated, and so common, substructures in graph data. We present techniques for dis...
David B. Skillicorn
JCIT
2008
138views more  JCIT 2008»
13 years 7 months ago
Enhancing the Routing Performance of Wireless Sensor Networks using Connected Dominating Sets
Many prominent applications in wireless sensor networks require collected information has to be routed to end nodes in an efficient manner. In general, Connected Dominating Set (C...
B. Paramasivan, Mohaideen Pitchai, Radha Krishnan
ISAAC
2010
Springer
277views Algorithms» more  ISAAC 2010»
13 years 5 months ago
Induced Subgraph Isomorphism on Interval and Proper Interval Graphs
The Induced Subgraph Isomorphism problem on two input graphs G and H is to decide whether G has an induced subgraph isomorphic to H. Already for the restricted case where H is a c...
Pinar Heggernes, Daniel Meister, Yngve Villanger
COMPLIFE
2005
Springer
14 years 1 months ago
The Architecture of a Proteomic Network in the Yeast
Abstract. We describe an approach to clustering the yeast protein-protein interaction network in order to identify functional modules, groups of proteins forming multi-protein comp...
Emad Ramadan, Christopher Osgood, Alex Pothen
BMCBI
2010
148views more  BMCBI 2010»
13 years 7 months ago
Structuring heterogeneous biological information using fuzzy clustering of k-partite graphs
Background: Extensive and automated data integration in bioinformatics facilitates the construction of large, complex biological networks. However, the challenge lies in the inter...
Mara L. Hartsperger, Florian Blöchl, Volker S...