scientific article; zbMATH DE number 1142299
From MaRDI portal
Publication:4385515
Cited in
(55)- Quantum approaches to graph colouring
- A partial k-arboretum of graphs with bounded treewidth
- Characterizing multiterminal flow networks and computing flows in networks of small treewidth
- On the complexity of scheduling with large communication delays
- The forbidden projections of unate functions
- How to define a linear order on finite models
- Efficient computation of implicit representations of sparse graphs
- Fugitive-search games on graphs and related parameters
- On treewidth and minimum fill-in of asteroidal triple-free graphs
- Algorithms for generalized vertex-rankings of partial k-trees
- Semi-dynamic breadth-first search in digraphs
- Conjunctive-query containment and constraint satisfaction
- Computing the branchwidth of interval graphs
- Sorting, linear time and the satisfiability problem
- Approximation algorithms for classes of graphs excluding single-crossing graphs as minors
- Algebraic approach to fasciagraphs and rotagraphs
- HAMILTONian circuits in chordal bipartite graphs
- Finding regular subgraphs in both arbitrary and planar graphs
- Upper bounds to the clique width of graphs
- Maximum packing for \(k\)-connected partial \(k\)-trees in polynomial time
- On the expressive power of temporal logic
- On the job rotation problem
- Fast fixed-parameter tractable algorithms for nontrivial generalizations of vertex cover
- Recognizing Hamming graphs in linear time and space
- Graph minors and parameterized algorithm design
- Random duplicate storage strategies for load balancing in multimedia servers
- Algorithmic aspects of open neighborhood location-domination in graphs
- How to Use Planarity Efficiently: New Tree-Decomposition Based Algorithms
- Matching and weighted \(P_2\)-packing: algorithms and kernels
- The monadic second-order logic of graphs III : tree-decompositions, minors and complexity issues
- Linkless and flat embeddings in 3-space
- Factoring with Two Large Primes
- Constructive linear time algorithms for branchwidth
- Treewidth and pathwidth of permutation graphs
- Finding even cycles even faster
- Confronting intractability via parameters
- Practical algorithms for MSO model-checking on tree-decomposable graphs
- Computing near‐optimal solutions to the steiner problem in a graph using a genetic algorithm
- Semi-dynamic shortest paths and breadth-first search in digraphs
- Parametric problems on graphs of bounded tree-width
- Optimal parametric search on graphs of bounded tree-width
- Practical algorithms on partial k-trees with an application to domination-like problems
- Representing graphs implicitly using almost optimal space
- Fixed-parameter complexity of \(\lambda\)-labelings
- Fully Dynamic Transitive Closure in plane dags with one source and one sink
- Dynamic algorithms for graphs with treewidth 2
- Learning of restricted RNLC graph languages
- Randomized parallel algorithms
- The complexity of subgraph isomorphism for classes of partial k-trees
- Fixed-parameter tractability and completeness II: On completeness for W[1]
- Inversion diameter and treewidth
- Trading uninitialized space for time
- Attribute value reordering for efficient hybrid OLAP
- Subgraph isomorphism, log-bounded fragmentation, and graphs of (locally) bounded treewidth
- Dynamic programming and planarity: improved tree-decomposition based algorithms
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4385515)
