Sciweavers

137 search results - page 5 / 28
» Critical Subgraphs of a Random Graph
Sort
View
TALG
2010
65views more  TALG 2010»
13 years 8 months ago
Maximal biconnected subgraphs of random planar graphs
Konstantinos Panagiotou, Angelika Steger
FOCS
2008
IEEE
14 years 4 months ago
Mixing Time of Exponential Random Graphs
A plethora of random graph models have been developed in recent years to study a range of problems on networks, driven by the wide availability of data from many social, telecommu...
Shankar Bhamidi, Guy Bresler, Allan Sly
CORR
2010
Springer
182views Education» more  CORR 2010»
13 years 10 months ago
Component structure induced by a random walk on a random graph
We consider random walks on two classes of random graphs and explore the likely structure of the vacant set viz. the set of unvisited vertices. Let (t) be the subgraph induced by ...
Colin Cooper, Alan M. Frieze
PVLDB
2010
200views more  PVLDB 2010»
13 years 8 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 6 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