scientific article; zbMATH DE number 1142299

Publication date: 4 May 1998

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

connectivity matchings shortest paths combinatorial structure graphs representation graphs generation

Analysis of algorithms and problem complexity (68Q25) Cryptography (94A60) Number-theoretic algorithms; complexity (11Y16)

Related Items (52)

Approximation algorithms for classes of graphs excluding single-crossing graphs as minors ⋮ On the expressive power of temporal logic ⋮ Recognizing Hamming graphs in linear time and space ⋮ Trading uninitialized space for time ⋮ Semi-dynamic shortest paths and breadth-first search in digraphs ⋮ Random duplicate storage strategies for load balancing in multimedia servers ⋮ Parametric problems on graphs of bounded tree-width ⋮ Optimal parametric search on graphs of bounded tree-width ⋮ Graph Minors and Parameterized Algorithm Design ⋮ Practical algorithms on partial k-trees with an application to domination-like problems ⋮ Attribute value reordering for efficient hybrid OLAP ⋮ The forbidden projections of unate functions ⋮ Algorithmic aspects of open neighborhood location-domination in graphs ⋮ How to define a linear order on finite models ⋮ Algebraic approach to fasciagraphs and rotagraphs ⋮ Constructive linear time algorithms for branchwidth ⋮ Efficient computation of implicit representations of sparse graphs ⋮ The monadic second-order logic of graphs III : tree-decompositions, minors and complexity issues ⋮ HAMILTONian circuits in chordal bipartite graphs ⋮ Finding regular subgraphs in both arbitrary and planar graphs ⋮ Subgraph isomorphism, log-bounded fragmentation, and graphs of (locally) bounded treewidth ⋮ Matching and weighted \(P_2\)-packing: algorithms and kernels ⋮ Fugitive-search games on graphs and related parameters ⋮ On treewidth and minimum fill-in of asteroidal triple-free graphs ⋮ Fully Dynamic Transitive Closure in plane dags with one source and one sink ⋮ How to Use Planarity Efficiently: New Tree-Decomposition Based Algorithms ⋮ Dynamic algorithms for graphs with treewidth 2 ⋮ Linkless and flat embeddings in 3-space ⋮ Confronting intractability via parameters ⋮ Practical algorithms for MSO model-checking on tree-decomposable graphs ⋮ Treewidth and pathwidth of permutation graphs ⋮ Finding even cycles even faster ⋮ Computing near‐optimal solutions to the steiner problem in a graph using a genetic algorithm ⋮ Upper bounds to the clique width of graphs ⋮ Maximum packing for \(k\)-connected partial \(k\)-trees in polynomial time ⋮ The complexity of subgraph isomorphism for classes of partial k-trees ⋮ Fixed-parameter tractability and completeness II: On completeness for W[1] ⋮ On the job rotation problem ⋮ Representing graphs implicitly using almost optimal space ⋮ Computing the branchwidth of interval graphs ⋮ Dynamic programming and planarity: improved tree-decomposition based algorithms ⋮ Fixed-parameter complexity of \(\lambda\)-labelings ⋮ Factoring with Two Large Primes ⋮ Quantum approaches to graph colouring ⋮ Sorting, linear time and the satisfiability problem ⋮ 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 ⋮ Algorithms for generalized vertex-rankings of partial k-trees ⋮ Semi-dynamic breadth-first search in digraphs ⋮ Conjunctive-query containment and constraint satisfaction ⋮ Fast fixed-parameter tractable algorithms for nontrivial generalizations of vertex cover

This page was built for publication: