820 search results - page 4 / 164 » Inducing Temporal Graphs |
RSA
2011
13 years 2 months ago
2011
An old problem of Erd˝os, Fajtlowicz and Staton asks for the order of a largest induced regular subgraph that can be found in every graph on n vertices. Motivated by this problem...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
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 ...
JCT
2007
13 years 7 months ago
2007
An induced subgraph is called homogeneous if it is either a clique or an independent set. Let hom(G) denote the size of the largest homogeneous subgraph of a graph G. In this shor...
SODA
2008
ACM
13 years 8 months ago
2008
ACM
One of the main questions that arise when studying random and quasi-random structures is which properties P are such that any object that satisfies P "behaves" like a tr...
GBRPR
2005
Springer
14 years 26 days ago
2005
Springer
Abstract. We present a direct algorithm that computes a largest common connected induced subgraph of two given graphs. It is based on an efficient generation of the common connecte...