scientific article; zbMATH DE number 1361465
From MaRDI portal
Publication:4699283
zbMath0941.05057MaRDI QIDQ4699283
Publication date: 3 August 2000
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Complexity and monotonicity results for domination games, Safe separators for treewidth, The parametrized complexity of knot polynomials, Definability in First Order Theories of Graph Orderings, Approximation algorithms for classes of graphs excluding single-crossing graphs as minors, An FPT-algorithm for modifying a graph of bounded treewidth to decrease the size of its dominating set using minimum modification, Fast Algorithms for Join Operations on Tree Decompositions, Complexity of list coloring problems with a fixed total number of colors, Fixed-Parameter Tractability of Treewidth and Pathwidth, Digraph Decompositions and Monotonicity in Digraph Searching, Approximation algorithms for treewidth, The relative clique-width of a graph, Unnamed Item, Online promise problems with online width metrics, Treewidth and pathwidth parameterized by the vertex cover number, Exact algorithms and applications for tree-like Weighted Set Cover, Eccentricity queries and beyond using hub labels, Inductive computations on graphs defined by clique-width expressions, Algorithmic uses of the Feferman-Vaught theorem, Subgraph isomorphism, log-bounded fragmentation, and graphs of (locally) bounded treewidth, Complexity and approximability of extended spanning star forest problems in general and complete graphs, Binary jumbled pattern matching on trees and tree-like structures, Directed elimination games, Augmenting graphs to minimize the radius, How to Use Planarity Efficiently: New Tree-Decomposition Based Algorithms, Small drawings of outerplanar graphs, series-parallel graphs, and other planar graphs, Obtaining a planar graph by vertex deletion, Exact algorithms for edge domination, Scheduling of pipelined operator graphs, Polynomial-time algorithms for special cases of the maximum confluent flow problem, Digraph decompositions and monotonicity in digraph searching, Consensus models: computational complexity aspects in modern approaches to the list coloring problem, The dag-width of directed graphs, The complexity of finding uniform sparsest cuts in various graph classes, Algorithms for graphs with small octopus, On the extension of a partial metric to a tree metric, On the algorithmic effectiveness of digraph decompositions and complexity measures, Subexponential parameterized algorithms, Bandwidth consecutive multicolorings of graphs, Guard games on graphs: keep the intruder out!, Maximum \(k\)-splittable \(s, t\)-flows, Practical algorithms for MSO model-checking on tree-decomposable graphs, Digraph measures: Kelly decompositions, games, and orderings, Predecessor existence problems for finite discrete dynamical systems, The Complexity Status of Problems Related to Sparsest Cuts, Complexity and exact algorithms for vertex multicut in interval and bounded treewidth graphs, Tree decompositions of graphs: saving memory in dynamic programming, Counting truth assignments of formulas of bounded tree-width or clique-width, \textsc{ToTo}: an open database for computation, storage and retrieval of tree decompositions, Parameterized complexity of spare capacity allocation and the multicost Steiner subgraph problem, On the fixed parameter complexity of graph enumeration problems definable in monadic second-order logic, Tree decomposition and discrete optimization problems: a survey, Semi-nice tree-decompositions: the best of branchwidth, treewidth and pathwidth with one algorithm, Experimental evaluation of a tree decomposition-based algorithm for vertex cover on planar graphs, Coloured Tutte polynomials and Kauffman brackets for graphs of bounded tree width, Complexity of the packing coloring problem for trees, Dynamic programming and planarity: improved tree-decomposition based algorithms, Modeling and analyzing social network dynamics using stochastic discrete graphical dynamical systems, Tree-decompositions of small pathwidth, Parameterized complexity of minimum membership dominating set, Upper and lower bounds for finding connected motifs in vertex-colored graphs, Models and solution techniques for frequency assignment problems, Default logic and bounded treewidth, Tree-decompositions of small pathwidth, Computing LOGCFL certificates, Width, depth, and space: tradeoffs between branching and dynamic programming, On some efficiently solvable classes of the network facility location problem with constraints on the capacities of communication lines, Derivation of algorithms for cutwidth and related graph layout parameters, Edge-maximal graphs of branchwidth \(k\): The \(k\)-branches, Triangulating Planar Graphs While Keeping the Pathwidth Small, Complexity results for minimum sum edge coloring, The parameterized complexity of the induced matching problem, AND/OR search spaces for graphical models, Empirical Evaluation of Approximation Algorithms for Generalized Graph Coloring and Uniform Quasi-wideness, Unnamed Item, A comparison of structural CSP decomposition methods, Backdoors to tractable answer set programming, Unnamed Item, Fast approximation schemes for K3, 3-minor-free or K5-minor-free graphs, Tree Decompositions of Graphs: Saving Memory in Dynamic Programming, Counting \(H-\)colorings of partial \(k-\)trees, Listing all potential maximal cliques of a graph, Empirical Evaluation of Approximation Algorithms for Generalized Graph Coloring and Uniform Quasi-Wideness, A generic convolution algorithm for join operations on tree decompositions
