Results 1  10
of
226
Fixed Parameter Algorithms for Dominating Set and Related Problems on Planar Graphs
, 2002
"... We present an algorithm that constructively produces a solution to the kdominating set problem for planar graphs in time O(c . To obtain this result, we show that the treewidth of a planar graph with domination number (G) is O( (G)), and that such a tree decomposition can be found in O( (G)n) time. ..."
Abstract

Cited by 105 (23 self)
 Add to MetaCart
We present an algorithm that constructively produces a solution to the kdominating set problem for planar graphs in time O(c . To obtain this result, we show that the treewidth of a planar graph with domination number (G) is O( (G)), and that such a tree decomposition can be found in O( (G)n) time. The same technique can be used to show that the kface cover problem ( find a size k set of faces that cover all vertices of a given plane graph) can be solved in O(c n) time, where c 1 = 3 and k is the size of the face cover set. Similar results can be obtained in the planar case for some variants of kdominating set, e.g., kindependent dominating set and kweighted dominating set.
The multivariate Tutte polynomial (alias Potts model) for graphs and matroids
 In Survey in Combinatorics, 2005, volume 327 of London Mathematical Society Lecture Notes
, 2005
"... and matroids ..."
PolynomialTime Approximation Schemes for Geometric Graphs
, 2001
"... A disk graph is the intersection graph of a set of disks with arbitrary diameters in the plane. For the case that the disk representation is given, we present polynomialtime approximation schemes (PTASs) for the maximum weight independent set problem (selecting disjoint disks of maximum total weigh ..."
Abstract

Cited by 71 (4 self)
 Add to MetaCart
A disk graph is the intersection graph of a set of disks with arbitrary diameters in the plane. For the case that the disk representation is given, we present polynomialtime approximation schemes (PTASs) for the maximum weight independent set problem (selecting disjoint disks of maximum total weight) and for the minimum weight vertex cover problem in disk graphs. These are the first known PTASs for NPhard optimization problems on disk graphs. They are based on a novel recursive subdivision of the plane that allows applying a shifting strategy on different levels simultaneously, so that a dynamic programming approach becomes feasible. The PTASs for disk graphs represent a common generalization of previous results for planar graphs and unit disk graphs. They can be extended to intersections graphs of other "disklike" geometric objects (such as squares or regular polygons), also in higher dimensions.
Graph Sandwich Problems
, 1994
"... The graph sandwich problem for property \Pi is defined as follows: Given two graphs G ) such that E ` E , is there a graph G = (V; E) such that E which satisfies property \Pi? Such problems generalize recognition problems and arise in various applications. Concentrating mainly o ..."
Abstract

Cited by 49 (8 self)
 Add to MetaCart
The graph sandwich problem for property \Pi is defined as follows: Given two graphs G ) such that E ` E , is there a graph G = (V; E) such that E which satisfies property \Pi? Such problems generalize recognition problems and arise in various applications. Concentrating mainly on properties characterizing subfamilies of perfect graphs, we give polynomial algorithms for several properties and prove the NPcompleteness of others. We describe
ρQueries: Enabling Querying for Semantic Associations on the Semantic Web
 In Proceedings of the Twelfth International WorldWide Web Conference
, 2003
"... This paper presents the notion of Semantic Associations as complex relationships between resource entities. These relationships capture both a connectivity of entities as well as similarity of entities based on a specific notion of similarity called ρisomorphism. It formalizes these notions for the ..."
Abstract

Cited by 43 (6 self)
 Add to MetaCart
This paper presents the notion of Semantic Associations as complex relationships between resource entities. These relationships capture both a connectivity of entities as well as similarity of entities based on a specific notion of similarity called ρisomorphism. It formalizes these notions for the RDF data model, by introducing a notion of a Property Sequence as a type. In the context of a graph model such as that for RDF, Semantic Associations amount to specific certain graph signatures. Specifically, they refer to sequences (i.e. directed paths) here called Property Sequences, between entities, networks of Property Sequences (i.e. undirected paths), or subgraphs of ρisomorphic Property Sequences. The ability to query about the existence of such relationships is fundamental to tasks in analytical domains such as national security and business intelligence, where tasks often focus on finding complex yet meaningful and obscured relationships between entities. However, support for such queries is lacking in contemporary query systems, including those for RDF. This paper discusses how querying for Semantic Associations might be enabled on the Semantic Web, through the use of an operator ρ. It also discusses two approaches for processing ρqueries on available persistent RDF stores and memory resident RDF data graphs, thereby building on current RDF query languages.
Complexity classification of some edge modification problems
, 2001
"... In an edge modification problem one has to change the edge set of a given graph as little as possible so as to satisfy a certain property. We prove the NPhardness of a variety of edge modification problems with respect to some wellstudied classes of graphs. These include perfect, chordal, chain, c ..."
Abstract

Cited by 41 (2 self)
 Add to MetaCart
In an edge modification problem one has to change the edge set of a given graph as little as possible so as to satisfy a certain property. We prove the NPhardness of a variety of edge modification problems with respect to some wellstudied classes of graphs. These include perfect, chordal, chain, comparability, split and asteroidal triple free. We show that some of these problems become polynomial when the input graph has bounded degree. We also give a general constant factor approximation algorithm for deletion and editing problems on bounded degree graphs with respect to properties that can be characterized by a finite set of forbidden induced subgraphs.
Approximations for λColorings of Graphs
 THE COMPUTER JOURNAL
, 2004
"... A λcoloring of a graph G is an assignment of colors from the integer set {0,...,λ} to the vertices of the graph G such that vertices at distance of at most two get different colors and adjacent vertices get colors which are at least two apart. The problem of finding λcolorings with optimal or near ..."
Abstract

Cited by 40 (0 self)
 Add to MetaCart
A λcoloring of a graph G is an assignment of colors from the integer set {0,...,λ} to the vertices of the graph G such that vertices at distance of at most two get different colors and adjacent vertices get colors which are at least two apart. The problem of finding λcolorings with optimal or nearoptimal λ arises in the context of radio frequency assignment. We show that the problem of finding the minimum λ for planar graphs, bipartite graphs, chordal graphs and split graphs is NPcomplete. We also give approximation algorithms for λcoloring and compute upper bounds on the best possible λ for outerplanar graphs, graphs of treewidth k, permutation and split graphs. Except in the case of split graphs, all the above bounds for λ are linear in ∆, the maximum degree of the graph. For split graphs, we give a bound of 1/2∆ 1.5 + 2 ∆ and we show that there are split graphs G with λ(G) = �(∆ 1.5). Similar results are also given for variations of the λcoloring problem.
Fixed parameter algorithms for planar dominating set and related problems
, 2000
"... We present an algorithm that constructively produces a solution to the kdominating set problem for planar graphs in time O(c √ kn), where c = 36√34. To obtain this result, we show that the treewidth of a planar graph with domination number γ(G) is O ( � γ(G)), and that such a tree decomposition ca ..."
Abstract

Cited by 35 (10 self)
 Add to MetaCart
We present an algorithm that constructively produces a solution to the kdominating set problem for planar graphs in time O(c √ kn), where c = 36√34. To obtain this result, we show that the treewidth of a planar graph with domination number γ(G) is O ( � γ(G)), and that such a tree decomposition can be found in O ( � γ(G)n) time. The same technique can be used to show that the kface cover problem (find a size k set of faces that cover all vertices of a given plane graph) can be solved √ k in O(c1 n + n2) time, where c1 = 236√34 and k is the size of the face cover set. Similar results can be obtained in the planar case for some variants of kdominating set, e.g., kindependent dominating set and kweighted dominating set. Keywords. NPcomplete problems, fixed parameter tractability, planar graphs, planar dominating set, face cover, outerplanarity, treewidth.
Computing common intervals of K permutations, with applications to modular decomposition of graphs
, 2008
"... We introduce a new approach to compute the common intervals of K permutations based on a very simple and general notion of generators of common intervals. This formalism leads to simple and efficient algorithms to compute the set of all common intervals of K permutations, that can contain a quadrat ..."
Abstract

Cited by 33 (13 self)
 Add to MetaCart
We introduce a new approach to compute the common intervals of K permutations based on a very simple and general notion of generators of common intervals. This formalism leads to simple and efficient algorithms to compute the set of all common intervals of K permutations, that can contain a quadratic number of intervals, as well as a linear space basis of this set of common intervals. Finally, we show how our results on permutations can be used for computing the modular decomposition of graphs.
On Linear Layouts of Graphs
, 2004
"... In a total order of the vertices of a graph, two edges with no endpoint in common can be crossing, nested, or disjoint. A kstack (resp... ..."
Abstract

Cited by 31 (19 self)
 Add to MetaCart
In a total order of the vertices of a graph, two edges with no endpoint in common can be crossing, nested, or disjoint. A kstack (resp...