S. Arnborg, J. Lagergren, and D. Seese. Easy problems for tree-decomposable graphs. Journal of Algorithms, 12(2): 308--340, 1991. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents Next 50
Algorithms for the Total Colorings of Graphs - Isobe (1993) (2 citations) (Correct)
....an algorithm to find such a total coloring in time O(sn ) where n is the number of the vertices. It is known that many NP hard problems, including the ordinary vertex and edge coloring problems, can be efficiently solved, mostly in linear time, for partial k trees, graphs with treewidth k [ACPS93, AL91, BPT92, Cou90]: for example, the vertex coloring problem can be solved in linear time for partial k trees by a standard dynamic programming algorithm# and the edge coloring problem can be solved in linear time for partial k trees [ZNN96] However, there has been no known efficient algorithm to solve the total ....
S. Arnborg and J. Lagergren, Easy problems for tree-decomposable graphs, J. Algorithms, 12(2), pp. 308--340, 1991.
The Minimum Cycle Cover and the Chinese Postman.. - Fernandes, Lee.. (1990) (1 citation) (Correct)
....with support in (W p W t ) where p is the parent of t in the tree T , but this does not reduce the complexity of the algorithm. It is known that any graph problem that can be stated as a logic formula of a certain type can be solved in linear time on graphs with bounded tree width [1, 6]. Many well known graph problems can be formulates as such formulas: maximum clique, maximum independent set, chromatic number and so on. However, mccp and cpp cannot [2, 4] It is still open whether there is a linear time algorithm for cpp (and mccp) on mixed graphs with bounded tree width. 3 ....
S. Arnborg, J. Lagergren and D. Seese. Easy problems for tree-decomposable graphs. Journal of Algorithms, 12 (1991), 308-340.
Generalized Model-Checking Over Locally Tree-Decomposable Classes - Frick (Correct)
.... in this direction is Courcelle s result: over graphs of tree width bounded by some constant w, monadic second order model checking can be done in fixed parameter linear time, i.e. in time O(f(###) #A#) for some (here fast growing) function f [5] This result was extended to the counting case [2] and recently to the construction and listing case [10] Note that for the listing problem, linear time means linear in the size of the input plus the output. There exist other successful restrictions take make algorithms more e#cient. Planarity and bounded valence are two important and natural ....
....In the context of model checking, tree decompositions allow the application of automata. This led to the following results, which actually have been proved for monadic second order logic. All model checking algorithms that will be presented in the sequel will use these results. Theorem 1 ([5, 2, 10]) Let be a class of structures of bounded tree width. FO MODEL CHECKING, FO CONSTRUCTION, FO EVALUATION and FO COUNTING on are all in fixed parameter linear time. 3 Locally tree decomposable classes Let # be a vocabulary and A a # structure. The Gaifman graph G(A) of A is the graph (G, E G ....
S. Arnborg, J. Lagergren, and D. Seese. Easy problems for tree-decomposable graphs. Journal of Algorithms, 12:308--340, 1991.
The Building Blocks of Complexity: A Unified Criterion and.. - Seese, Schlottmann (2003) Self-citation (Seese) (Correct)
....concerning decision situations e.g. for a manager. Basically, the latter situations are characterised by a non empty set S, I s I 1 of possible outcomes for a variable X (e.g. describing a certain state of a system or an amount of loss) at a fixed future time horizon t and probabilities Prob(X=s) [0,1] for the occurrence of each s S at time t. In contrast to this, if we face a decision under uncertainty over X we are not provided with possible outcomes and or the probabilities of the outcomes are not known. Of course, such uncertain situations and events are usually not manageable unless we get ....
Areborg, S., Lagergren, J. & Seese, D. 1991, 'Easy problems for tree-decomposable graphs', Journal of Algorithms 12, pp. 308-340.
Improved approximation algorithms for optimization.. - Czumaj, Lingas, Nilsson (2003) (Correct)
No context found.
S. Arnborg, J. Lagergren, and D. Seese. Easy problems for tree-decomposable graphs. Journal of Algorithms, 12(2): 308--340, 1991.
Necessary Edges in K-Chordalizations of Graphs - Hans Bodlaend Er (2000) (Correct)
No context found.
S. Arnborg, J. Lagergren, and D. Seese. Easy problems for treedecomposable graphs. J. Algorithms, 12:308--340, 1991.
Safe Separators for Treewidth - Hans Bodlaender Arie (2003) (Correct)
No context found.
S. Arnborg, J. Lagergren, and D. Seese. Easy problems for tree-decomposable graphs. J. Algorithms, 12:308--340, 1991.
Computations - Hans Bodlaender Department (2006) (Correct)
No context found.
S. Arnborg, J. Lagergren, and D. Seese. Easy problems for tree-decomposable graphs. J. Algorithms, 12:308-- 340, 1991.
Hans L. Bodlaender - Andreas Brandst Adt (2003) (Correct)
No context found.
S. ARNBORG, J. LAGERGREN, D. SEESE, Easy problems for tree-decomposable graphs, J. Algorithms 12 (1991), 308-340
Space-Ecient Construction Variants of - Dynamic Programming Hans (2004) (Correct)
No context found.
S. Arnborg, J. Lagergren, and D. Seese. Easy problems for tree-decomposable graphs. J. Algorithms, 12, 308--340 (1991). 10
Exact, Upper, and Lower Bounds on - Treewidth Emgad Bachoore (2006) (Correct)
No context found.
S. Arnborg, J. Lagergren, and D. Seese. Easy problems for tree-decomposable graphs. J. Algorithms, 12:308-340, 1991.
Factoring and Recognition of Read-Once Functions Using.. - Golumbic, Mintz, Rotics (2004) (Correct)
No context found.
S. Arnborg, J. Lagergren, and D. Seese. Easy problems for treedecomposable graphs. Journal of Algorithms, 12:308--340, 1991.
Tree-width and the Sherali-Adams operator - Bienstock, Ozbay (2003) (Correct)
No context found.
S. Arnborg, J. Lagergren and D. Seese, Easy problems for tree-decomposable graphs, J. Algorithms 2 (1991), 308-340.
Space-Efficient Construction Variants of Dynamic Programming - Bodlaender, Telle (2004) (Correct)
No context found.
S. Arnborg, J. Lagergren, and D. Seese. Easy problems for tree-decomposable graphs. J. Algorithms, 12, 308--340 (1991). 10
Deciding Clique-Width for Graphs of Bounded Tree-Width - Espelage, Gurski, Wanke (2003) (Correct)
No context found.
S. Arnborg, J. Lagergren, and D. Seese. Easy problems for treedecomposable graphs. Journal of Algorithms, 12:308--340, 1991.
Parameterized Parallel Complexity - Cesati, Di Ianni (1997) (4 citations) (Correct)
No context found.
Stefan Arnborg, Jens Lagergren, and Detlef Seese. Easy problems for tree-decomposable graphs. Journal of Algorithms, 12, 308--340, 1991.
Safe Separators for Treewidth - Bodlaender, Koster (2003) (Correct)
No context found.
S. Arnborg, J. Lagergren, and D. Seese. Easy problems for tree-decomposable graphs. J. Algorithms, 12:308--340, 1991.
Polynomials of Bounded Tree-Width - Makowsky, Meer (2000) (Correct)
No context found.
S. Arnborg, J. Lagergren, and D. Seese. Easy problems for tree decomposable graphs. Journal of Algorithms, 12:308--340, 1991. Conclusions and further research 9
On the Tree Width of Ada Programs - Burgstaller, Blieberger, Scholz (Correct)
No context found.
Stefan Arnborg, Jens Lagergren, and Detlef Seese, Easy problems for treedecomposable graphs, Journal of Algorithms 12 (1991), 308--340.
Map Genus, Forbidden Maps, and Monadic Second-Order Logic - Courcelle, Dussaux (Correct)
No context found.
S. Arnborg, J. Lagergren, and D. Seese. Easy problems for tree-decomposable graphs. Journal of Algorithms, 12:308--340, 1991.
On Algorithms for (P_5,Gem)-Free Graphs - Bodlaender, Brandstädt, Kratsch, .. (2003) (Correct)
No context found.
S. ARNBORG, J. LAGERGREN, D. SEESE, Easy problems for tree-decomposable graphs, J. Algorithms 12 (1991), 308-340
Map Genus, Forbidden Maps, and Monadic Second-Order Logic - Courcelle, Dussaux (2002) (Correct)
No context found.
S. Arnborg, J. Lagergren, and D. Seese. Easy problems for tree-decomposable graphs. Journal of Algorithms, 12:308-340, 1991.
Models and Approximation Algorithms for Channel Assignment .. - Krumke, Marathe, Ravi (2000) (7 citations) (Correct)
No context found.
S. Arnborg, J. Lagergren and D. Seese, Easy Problems for TreeDecomposable Graphs, J. Algorithms, 12 (1991), pp. 308--340.
Easy Instances for Model Checking - Frick (2001) (Correct)
No context found.
S. Arnborg, J. Lagergren, and D. Seese. Easy problems for treedecomposable graphs. Journal of Algorithms, 12:308-340, 1991.
Automata-Based Representations for Infinite Graphs - Torre, Napoli (2001) (Correct)
No context found.
S. Arnborg, J. Lagergren and D. Seese, \Easy problems for tree-decomposable graphs", Journal of Algorithms, 12 (1991) 308-340.
First 50 documents Next 50
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC