scientific article; zbMATH DE number 1303600
From MaRDI portal
Publication:4250226
zbMath0930.68016MaRDI QIDQ4250226
Jan Arne Telle, Jens Gustedt, Hans L. Bodlaender
Publication date: 17 June 1999
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Graph theory (including graph drawing) in computer science (68R10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items (17)
Memory requirements for table computations in partial k-tree algorithms ⋮ Combining intensification and diversification strategies in VNS. An application to the vertex separation problem ⋮ Variable neighborhood search for the vertex separation problem ⋮ The tree-width of C ⋮ Fair allocation algorithms for indivisible items under structured conflict constraints ⋮ Treewidth versus clique number. II: Tree-independence number ⋮ Typical sequences revisited -- computing width parameters of graphs ⋮ The complexity of register allocation ⋮ Tree-decompositions of small pathwidth ⋮ Linear ordering based MIP formulations for the vertex separation or pathwidth problem ⋮ Circular-arc graph coloring: On chords and circuits in the meeting graph ⋮ Tree-decompositions of small pathwidth ⋮ Derivation of algorithms for cutwidth and related graph layout parameters ⋮ All structured programs have small tree width and good register allocation ⋮ Treewidth versus Clique Number. I. Graph Classes with a Forbidden Structure ⋮ Experimental Evaluation of a Branch-and-Bound Algorithm for Computing Pathwidth and Directed Pathwidth ⋮ Listing all potential maximal cliques of a graph
This page was built for publication:
