scientific article; zbMATH DE number 1303600
From MaRDI portal
Publication:4250226
Recommendations
Cited in
(27)- Derivation of algorithms for cutwidth and related graph layout parameters
- All structured programs have small tree width and good register allocation
- Listing all potential maximal cliques of a graph
- The tree-width of C
- The complexity of register allocation
- Typical sequences revisited -- computing width parameters of graphs
- Register allocation: A program-algebraic approach
- Combining intensification and diversification strategies in VNS. An application to the vertex separation problem
- Variable neighborhood search for the vertex separation problem
- Optimal shuffle code with permutation instructions
- scientific article; zbMATH DE number 512911 (Why is no real title available?)
- On Local Register Allocation
- scientific article; zbMATH DE number 2087571 (Why is no real title available?)
- Treewidth versus clique number. I: Graph classes with a forbidden structure
- Memory requirements for table computations in partial k-tree algorithms
- Experimental evaluation of a branch-and-bound algorithm for computing pathwidth and directed pathwidth
- Aliased Register Allocation for Straight-Line Programs Is NP-Complete
- Tree-decompositions of small pathwidth
- Linear ordering based MIP formulations for the vertex separation or pathwidth problem
- Tree-decompositions of small pathwidth
- Circular-arc graph coloring: On chords and circuits in the meeting graph
- Fair allocation algorithms for indivisible items under structured conflict constraints
- Treewidth versus clique number. II: Tree-independence number
- Computational graphs for matrix functions
- Computing tree decompositions with small independence number
- Comparing width parameters on graph classes
- Linear colorings of graphs
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 Q4250226)
