Sciweavers

124 search results - page 15 / 25
» Undirected Graphs of Entanglement Two
Sort
View
ICDM
2006
IEEE
134views Data Mining» more  ICDM 2006»
14 years 1 months ago
Fast Frequent Free Tree Mining in Graph Databases
Free tree, as a special graph which is connected, undirected and acyclic, is extensively used in domains such as computational biology, pattern recognition, computer networks, XML...
Peixiang Zhao, Jeffrey Xu Yu
ISAAC
2005
Springer
106views Algorithms» more  ISAAC 2005»
14 years 27 days ago
Generating Cut Conjunctions and Bridge Avoiding Extensions in Graphs
Let G = (V, E) be an undirected graph, and let B ⊆ V × V be a collection of vertex pairs. We give an incremental polynomial time algorithm to enumerate all minimal edge sets X â...
Leonid Khachiyan, Endre Boros, Konrad Borys, Khale...
WEBI
2005
Springer
14 years 26 days ago
A Novel Way of Computing Similarities between Nodes of a Graph, with Application to Collaborative Recommendation
This work presents a new perspective on characterizing the similarity between elements of a database or, more generally, nodes of a weighted, undirected, graph. It is based on a M...
François Fouss, Alain Pirotte, Marco Saeren...
APWEB
2006
Springer
13 years 11 months ago
Strongly Connected Dominating Sets in Wireless Sensor Networks with Unidirectional Links
A Connected Dominating Set (CDS) can serve as a virtual backbone for a wireless sensor network since there is no fixed infrastructure or centralized management in wireless sensor n...
Ding-Zhu Du, My T. Thai, Yingshu Li, Dan Liu, Shiw...
STOC
2009
ACM
168views Algorithms» more  STOC 2009»
14 years 8 months ago
Fault-tolerant spanners for general graphs
The paper concerns graph spanners that are resistant to vertex or edge failures. Given a weighted undirected n-vertex graph G = (V, E) and an integer k 1, the subgraph H = (V, E ...
Shiri Chechik, Michael Langberg, David Peleg, Liam...