Results 71 to 80 of about 11,505 (254)
Tree-width and large grid minors in planar graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2011 Graphs and ...
Alexander Grigoriev
doaj +1 more source
Pre-processing for Triangulation of Probabilistic Networks [PDF]
, 2013 The currently most efficient algorithm for inference with a probabilistic network builds upon a triangulation of a network's graph. In this paper, we show that pre-processing can help in finding good triangulations forprobabilistic networks, that is ...
Bodlaender, Hans L. +3 more
core +2 more sources
Challenges for Efficient Query Evaluation on Structured Probabilistic Data
, 2016 Query answering over probabilistic data is an important task but is generally intractable. However, a new approach for this problem has recently been proposed, based on structural decompositions of input databases, following, e.g., tree decompositions ...
A Amarilli +11 more
core +3 more sources
Beyond Bidimensionality: Parameterized Subexponential Algorithms on Directed Graphs [PDF]
, 2010 We develop two different methods to achieve subexponential time parameterized algorithms for problems on sparse directed graphs. We exemplify our approaches with two well studied problems.
Dorn, Frederic +4 more
core +5 more sources
A Coarse Geometric Approach to Graph Layout Problems
Journal of Graph Theory, EarlyView.ABSTRACT We define a range of new coarse geometric invariants based on various graph–theoretic measures of complexity for finite graphs, including treewidth, pathwidth, cutwidth and bandwidth. We prove that, for bounded degree graphs, these invariants can be used to define functions which satisfy a strong monotonicity property, namely, they are ...
Wanying Huang +3 more
wiley +1 more source
International Journal of Foundations of Computer Science, 1993 In this paper we show that the treewidth of a circle graph can be computed in polynomial time. A circle graph is a graph that is isomorphic to the intersection graph of a finite collection of chords of a circle. The TREEWIDTH problem can be viewed upon as the problem of finding a chordal embedding of the graph that minimizes the clique number.
openaire +5 more sources
On the k-rainbow domination in graphs with bounded tree-width
Electronic Journal of Graph Theory and Applications, 2021 Given a positive integer k and a graph G = (V, E), a function f from V to the power set of Ik is called a k-rainbow function if for each vertex v ∈ V, f(v)=∅ implies ∪u ∈ N(v)f(u)=Ik where N(v) is the set of all neighbors of vertex v and Ik = {1, …, k ...
M. Alambardar Meybodi +3 more
doaj +1 more source
Exact Solutions for the Moving Firefighter Problem on Trees
Networks, EarlyView.ABSTRACT The moving firefighter problem (MFP) is a more realistic variant of the classic firefighter problem (FP), where firefighters require time for both travel and defense. Unfortunately, the only known exact solution for the MFP does not scale. In this paper, we establish that the MFP is NP‐complete on trees of maximum degree three and present four
Mauro A. Montenegro‐Meza +4 more
wiley +1 more source
CoRRA witness drawing of a graph is a visualization that clearly shows a given property of a graph. We study and implement various drawing paradigms for witness drawings to clearly show that graphs have bounded pathwidth or treewidth. Our approach draws the tree decomposition or path decomposition as a tree of bags, with induced subgraphs shown in each bag,
Chiu, Alvin +4 more
openaire +3 more sources