The following pages link to (Q4250226):
Displaying 18 items.
- Combining intensification and diversification strategies in VNS. An application to the vertex separation problem (Q337212) (← links)
- Variable neighborhood search for the vertex separation problem (Q339678) (← links)
- Derivation of algorithms for cutwidth and related graph layout parameters (Q1015810) (← links)
- All structured programs have small tree width and good register allocation (Q1271620) (← links)
- Listing all potential maximal cliques of a graph (Q1605302) (← links)
- The tree-width of C (Q2174562) (← links)
- The complexity of register allocation (Q2442207) (← links)
- Typical sequences revisited -- computing width parameters of graphs (Q2701067) (← links)
- Treewidth versus Clique Number. I. Graph Classes with a Forbidden Structure (Q5013568) (← links)
- Memory requirements for table computations in partial k-tree algorithms (Q5054858) (← links)
- Experimental Evaluation of a Branch-and-Bound Algorithm for Computing Pathwidth and Directed Pathwidth (Q5266611) (← links)
- Tree-decompositions of small pathwidth (Q5899355) (← links)
- Linear ordering based MIP formulations for the vertex separation or pathwidth problem (Q5915912) (← links)
- Tree-decompositions of small pathwidth (Q5916128) (← links)
- Circular-arc graph coloring: On chords and circuits in the meeting graph (Q5953338) (← links)
- Fair allocation algorithms for indivisible items under structured conflict constraints (Q6056608) (← links)
- Treewidth versus clique number. II: Tree-independence number (Q6144406) (← links)
- Computational graphs for matrix functions (Q6599989) (← links)
