Publication:4385515
From MaRDI portal
zbMath0900.68258MaRDI QIDQ4385515
Publication date: 4 May 1998
connectivity; matchings; shortest paths; combinatorial structure; graphs representation; graphs generation
68Q25: Analysis of algorithms and problem complexity
94A60: Cryptography
11Y16: Number-theoretic algorithms; complexity
Related Items
Factoring with Two Large Primes, Computing near‐optimal solutions to the steiner problem in a graph using a genetic algorithm, The complexity of subgraph isomorphism for classes of partial k-trees, Fixed-parameter tractability and completeness II: On completeness for W[1], 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, Sorting, linear time and the satisfiability problem, 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, The monadic second-order logic of graphs III : tree-decompositions, minors and complexity issues
