Sciweavers

5606 search results - page 9 / 1122
» Randomization Techniques for Graphs.
Sort
View
PVLDB
2010
200views more  PVLDB 2010»
13 years 6 months ago
SAPPER: Subgraph Indexing and Approximate Matching in Large Graphs
With the emergence of new applications, e.g., computational biology, new software engineering techniques, social networks, etc., more data is in the form of graphs. Locating occur...
Shijie Zhang, Jiong Yang, Wei Jin
CIAC
2010
Springer
281views Algorithms» more  CIAC 2010»
13 years 4 months ago
Parameterized Complexity of Even/Odd Subgraph Problems
We study the parameterized complexity of the problems of determining whether a graph contains a k-edge subgraph (k-vertex induced subgraph) that is a -graph for -graphs being one ...
Leizhen Cai, Boting Yang
PAKDD
2009
ACM
133views Data Mining» more  PAKDD 2009»
14 years 2 months ago
On Link Privacy in Randomizing Social Networks
Many applications of social networks require relationship anonymity due to the sensitive, stigmatizing, or confidential nature of relationship. Recent work showed that the simple ...
Xiaowei Ying, Xintao Wu
PODC
2010
ACM
13 years 11 months ago
A new technique for distributed symmetry breaking
We introduce Multi-Trials, a new technique for symmetry breaking for distributed algorithms and apply it to various problems in general graphs. For instance, we present three rand...
Johannes Schneider, Roger Wattenhofer

Book
1174views
15 years 5 months ago
Graph Theory
A well-written book about graph theory.
Reinhard Diestel