Results 1  10
of
559
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
Maintenance of Materialized Views: Problems, Techniques, and Applications
, 1995
"... In this paper we motivate and describe materialized views, their applications, and the problems and techniques for their maintenance. We present a taxonomy of view maintenanceproblems basedupon the class of views considered, upon the resources used to maintain the view, upon the types of modi#cati ..."
Abstract

Cited by 314 (9 self)
 Add to MetaCart
In this paper we motivate and describe materialized views, their applications, and the problems and techniques for their maintenance. We present a taxonomy of view maintenanceproblems basedupon the class of views considered, upon the resources used to maintain the view, upon the types of modi#cations
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
On the (non)existence of polynomial kernels for Plfree edge modi problems
 In: V. Raman and S. Saurabh (Eds.): IPEC 2010, LNCS 6478:147{157
, 2010
"... Given a graph G = (V,E) and an integer k, an edge modification problem for a graph property Π consists in deciding whether there exists a set of edges F of size at most k such that the graph H = (V,E M F) satisfies the property Π. In the Π edgecompletion problem, the set F of edges is constrained t ..."
Abstract

Cited by 11 (2 self)
 Add to MetaCart
or cycles and pointed out that the problem is already open in the case of P4free graphs (i.e. cographs). This paper provides positive and negative results in that line of research. We prove that parameterized cograph edge modification problems have cubic vertex kernels whereas polynomial kernels
Combining convergence and diversity in evolutionary multiobjective optimization
 Evolutionary Computation
, 2002
"... Over the past few years, the research on evolutionary algorithms has demonstrated their niche in solving multiobjective optimization problems, where the goal is to �nd a number of Paretooptimal solutions in a single simulation run. Many studies have depicted different ways evolutionary algorithms c ..."
Abstract

Cited by 159 (15 self)
 Add to MetaCart
number of earlier MOEAs do not have such properties. Based on the concept ofdominance, new archiving strategies are proposed that overcome this fundamental problem and provably lead to MOEAs that have both the desired convergence and distribution properties. A number of modi�cations to the baseline
Negotiation and cooperation in multiagent environments
 Artificial Intelligence
, 1997
"... Automated intelligent agents inhabiting a shared environmentmust coordinate their activities. Cooperation { not merely coordination { may improve the performance of the individual agents or the overall behavior of the system they form. Research in Distributed Arti cial Intelligence (DAI) addresses t ..."
Abstract

Cited by 149 (5 self)
 Add to MetaCart
research, physics and philosophy. To support this claim, we describe some of our projects, where we have successfully taken an interdisciplinary approach. We demonstrate the bene ts in applying multientity methodologies and show the adaptations, modi cations and extensions necessary for solving the DAI
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
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
A Theoretical Evaluation of Selected Backtracking Algorithms
 Artificial Intelligence
, 1997
"... In recent years, many new backtracking algorithms for solving constraint satisfaction problems have been proposed. The algorithms are usually evaluated by empirical testing. This method, however, has its limitations. Our paper adopts a di erent, purely theoretical approach, which is based on charact ..."
Abstract

Cited by 124 (3 self)
 Add to MetaCart
Directed Backjumping, and show that Forward Checking never visits more nodes than Backjumping. Our approach leads us also to propose a modi cation to two hybrid backtracking algorithms, Backmarking with Backjumping (BMJ) and Backmarking with Con ictDirected Backjumping (BMCBJ), so that they always perform fewer
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
Results 1  10
of
559