Results 1  10
of
1,531
Incompressibility of HFree Edge Modification
"... Abstract. Given a fixed graph H, the HFree Edge Deletion (resp., Completion, Editing) problems ask whether it is possible to delete from (resp., add to, delete from or add to) the input graph at most k edges so that the resulting graph is Hfree, i.e., contains no induced subgraph isomorphic to H. ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
Abstract. Given a fixed graph H, the HFree Edge Deletion (resp., Completion, Editing) problems ask whether it is possible to delete from (resp., add to, delete from or add to) the input graph at most k edges so that the resulting graph is Hfree, i.e., contains no induced subgraph isomorphic to H
Incompressibility of HFree Edge Modification Problems
, 2014
"... Given a fixed graph H, the HFree Edge Deletion (resp., Completion, Editing) problem asks whether it is possible to delete from (resp., add to, delete from or add to) the input graph at most k edges so that the resulting graph is Hfree, i.e., contains no induced subgraph isomorphic to H. These Hfr ..."
Abstract
 Add to MetaCart
Given a fixed graph H, the HFree Edge Deletion (resp., Completion, Editing) problem asks whether it is possible to delete from (resp., add to, delete from or add to) the input graph at most k edges so that the resulting graph is Hfree, i.e., contains no induced subgraph isomorphic to H. These Hfree
Two edge modification problems without polynomial kernels
 IN IWPEC, VOLUME 5917 OF LNCS
, 2009
"... Given a graph G and an integer k, the Π Edge Completion/Editing/Deletion problem asks whether it is possible to add, edit, or delete at most k edges in G such that one obtains a graph that fulfills the property Π. Edge modification problems have received considerable interest from a parameterized ..."
Abstract

Cited by 16 (2 self)
 Add to MetaCart
framework for proving polynomial lower bounds for kernelizability. We present a graph H on seven vertices such that Hfree Edge Deletion and Hfree Edge Editing do not admit polynomial kernelizations, unless NP ⊆ coNP/poly. The application of the framework is not immediate and requires a lower bound for a
Fibonacci Heaps and Their Uses in Improved Network optimization algorithms
, 1987
"... In this paper we develop a new data structure for implementing heaps (priority queues). Our structure, Fibonacci heaps (abbreviated Fheaps), extends the binomial queues proposed by Vuillemin and studied further by Brown. Fheaps support arbitrary deletion from an nitem heap in qlogn) amortized tim ..."
Abstract

Cited by 739 (18 self)
 Add to MetaCart
In this paper we develop a new data structure for implementing heaps (priority queues). Our structure, Fibonacci heaps (abbreviated Fheaps), extends the binomial queues proposed by Vuillemin and studied further by Brown. Fheaps support arbitrary deletion from an nitem heap in qlogn) amortized
Coloring Hfree hypergraphs
, 2008
"... Fix r ≥ 2 and a collection of runiform hypergraphs H. What is the minimum number of edges in an Hfree runiform hypergraph with chromatic number greater than k? We investigate this question for various H. Our results include the following: • An (r, l)system is an runiform hypergraph with every t ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
Fix r ≥ 2 and a collection of runiform hypergraphs H. What is the minimum number of edges in an Hfree runiform hypergraph with chromatic number greater than k? We investigate this question for various H. Our results include the following: • An (r, l)system is an runiform hypergraph with every
unknown title
, 2015
"... Abstract Given a fixed graph H , the H Free Edge Deletion (resp., Completion, Editing) problem asks whether it is possible to delete from (resp., add to, delete from or add to) the input graph at most k edges so that the resulting graph is H free, i.e., contains no induced subgraph isomorphic to ..."
Abstract
 Add to MetaCart
Abstract Given a fixed graph H , the H Free Edge Deletion (resp., Completion, Editing) problem asks whether it is possible to delete from (resp., add to, delete from or add to) the input graph at most k edges so that the resulting graph is H free, i.e., contains no induced subgraph isomorphic
The early evolution of the Hfree process
, 2009
"... The Hfree process, for some fixed graph H, is the random graph process defined by starting with an empty graph on n vertices and then adding edges one at a time, chosen uniformly at random subject to the constraint that no H subgraph is formed. Let G be the random maximal Hfree graph obtained at t ..."
Abstract

Cited by 33 (4 self)
 Add to MetaCart
The Hfree process, for some fixed graph H, is the random graph process defined by starting with an empty graph on n vertices and then adding edges one at a time, chosen uniformly at random subject to the constraint that no H subgraph is formed. Let G be the random maximal Hfree graph obtained
A Data Structure for Dynamic Trees
, 1983
"... A data structure is proposed to maintain a collection of vertexdisjoint trees under a sequence of two kinds of operations: a link operation that combines two trees into one by adding an edge, and a cut operation that divides one tree into two by deleting an edge. Each operation requires O(log n) ti ..."
Abstract

Cited by 347 (21 self)
 Add to MetaCart
A data structure is proposed to maintain a collection of vertexdisjoint trees under a sequence of two kinds of operations: a link operation that combines two trees into one by adding an edge, and a cut operation that divides one tree into two by deleting an edge. Each operation requires O(log n
Random maximal Hfree graphs
, 1999
"... Given a graph H , a random maximal Hfree graph is constructed by the following random greedy process. First assign to each edge of the complete graph on n vertices a birthtime which is uniformly distributed in [0; 1]. At time p = 0 start with the empty graph and increase p gradually. Each time ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
Given a graph H , a random maximal Hfree graph is constructed by the following random greedy process. First assign to each edge of the complete graph on n vertices a birthtime which is uniformly distributed in [0; 1]. At time p = 0 start with the empty graph and increase p gradually. Each time
Results 1  10
of
1,531