Sciweavers

56 search results - page 1 / 12
» The Speed of Hereditary Properties of Graphs
Sort
View
JCT
2000
70views more  JCT 2000»
13 years 5 months ago
The Speed of Hereditary Properties of Graphs
József Balogh, Béla Bollobás,...
IPL
2007
121views more  IPL 2007»
13 years 5 months ago
Parameterized complexity of the induced subgraph problem in directed graphs
In this paper, we consider the parameterized complexity of the following problem: Given a hereditary property P on digraphs, an input digraph D and a positive integer k, does D ha...
Venkatesh Raman, Somnath Sikdar
ECCC
2007
124views more  ECCC 2007»
13 years 5 months ago
Testing Hereditary Properties of Non-Expanding Bounded-Degree Graphs
We study graph properties which are testable for bounded degree graphs in time independent of the input size. Our goal is to distinguish between graphs having a predetermined grap...
Artur Czumaj, Asaf Shapira, Christian Sohler
ISAAC
2007
Springer
100views Algorithms» more  ISAAC 2007»
13 years 11 months ago
Dynamic Distance Hereditary Graphs Using Split Decomposition
The problem of maintaining a representation of a dynamic graph as long as a certain property is satisfied has recently been considered for a number of properties. This paper prese...
Emeric Gioan, Christophe Paul
RSA
2008
103views more  RSA 2008»
13 years 4 months ago
What is the furthest graph from a hereditary property?
For a graph property P, the edit distance of a graph G from P, denoted EP (G), is the minimum number of edge modifications (additions or deletions) one needs to apply to G in orde...
Noga Alon, Uri Stav