Results 1  10
of
214
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
Hardness of edgemodification problems
"... For a graph property P consider the following computational problem. Given an input graph G, what is the minimum number of edge modifications (additions and/or deletions) that one has to apply to G in order to turn it into a graph that satisfies P? Namely, what is the edit distance ∆(G, P) of a grap ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
on the hardness of computing the edit distance from being induced Hfree for any forbidden graph H. 1
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
Contracting Few Edges to Remove Forbidden Induced Subgraphs
"... Abstract. For a given graph property Π (i.e., a collection Π of graphs), the ΠContraction problem is to determine whether the input graph G can be transformed into a graph satisfying property Π by contracting at most k edges, where k is a parameter. In this paper, we mainly focus on the parameteriz ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
on the parameterized complexity of ΠContraction problems for Π being Hfree (i.e., containing no induced subgraph isomorphic to H) for various fixed graphs H. We show that Clique Contraction (equivalently, P3Free Contraction for connected graphs) is FPT (fixedparameter tractable) but admits no polynomial kernel
VisibilityBased PursuitEvasion in a Polygonal Environment
 International Journal of Computational Geometry and Applications
, 1997
"... This paper addresses the problem of planning the motion of one or more pursuers in a polygonal environment to eventually "see" an evader that is unpredictable, has unknown initial position, and is capable of moving arbitrarily fast. This problem was first introduced by Suzuki and Yamashita ..."
Abstract

Cited by 109 (25 self)
 Add to MetaCart
strategy for a single pursuer. For simplyconnected free spaces, it is shown that the minimum number of pursuers required is \Theta(lg n). For multiplyconnected free spaces, the bound is \Theta( p h + lg n) pursuers for a polygon that has n edges and h holes. A set of problems that are solvable by a single
The edge disjoint paths problem in Eulerian graphs and 4edgeconnected graphs
, 2010
"... We consider the following wellknown problem, which is called the edgedisjoint paths problem. Input: A graph G with n vertices and m edges, k pairs of vertices (s1, t1), (s2, t2),..., (sk, tk) in G. Output: Edgedisjoint paths P1, P2,..., Pk in G such that Pi joins si and ti for i = 1, 2,..., k. R ..."
Abstract

Cited by 6 (2 self)
 Add to MetaCart
RobertsonSeymour’s. In addition, if an input graph G is either 4edgeconnected planar or Eulerian planar, k is allowed to be O((log n) 1 2 −ε) for any ε> 0. The same thing holds for bounded genus graphs. Moreover, if an input graph is either 4edgeconnected Hminorfree or Eulerian Hminorfree
Free edge lengths . . .
, 2014
"... We study the impact of metric constraints on the realizability of planar graphs. Let G be a subgraph of a planar graph H (where H is the “host ” of G). The graph G is free in H if for every choice of positive lengths for the edges of G, the host H has a planar straightline embedding that realizes t ..."
Abstract
 Add to MetaCart
We study the impact of metric constraints on the realizability of planar graphs. Let G be a subgraph of a planar graph H (where H is the “host ” of G). The graph G is free in H if for every choice of positive lengths for the edges of G, the host H has a planar straightline embedding that realizes
Algebraic multigrid for edge elements
 Johannes Kepler University Linz
"... This paper presents an algebraic multigrid method for the ecient solution of the linear system arising from a nite element discretization of variational problems inH 0 (rot;). The nite element spaces are generated by Nedelecelements (Whitney1forms or further referenced to as edge elements). A c ..."
Abstract

Cited by 6 (3 self)
 Add to MetaCart
This paper presents an algebraic multigrid method for the ecient solution of the linear system arising from a nite element discretization of variational problems inH 0 (rot;). The nite element spaces are generated by Nedelecelements (Whitney1forms or further referenced to as edge elements). A
Free Edge Lengths in Plane Graphs
"... We study the impact of metric constraints on the realizability of planar graphs. Let G be a subgraph of a planar graphH (whereH is the “host ” ofG). The graphG is free inH if for every choice of positive lengths for the edges of G, the host H has a planar straightline embedding that realizes these ..."
Abstract
 Add to MetaCart
We study the impact of metric constraints on the realizability of planar graphs. Let G be a subgraph of a planar graphH (whereH is the “host ” ofG). The graphG is free inH if for every choice of positive lengths for the edges of G, the host H has a planar straightline embedding that realizes
Results 1  10
of
214