Pages that link to "Item:Q1149765"

The following pages link to Black-white pebbles and graph separation (Q1149765):

Displaying 18 items.

• Variable neighborhood search for the vertex separation problem (Q339678) (← links)
• Minimizing makespan for a bipartite graph on a single processor with an integer precedence delay. (Q703281) (← links)
• The treewidth of line graphs (Q723884) (← links)
• Min Cut is NP-complete for edge weighted trees (Q1111019) (← links)
• Narrowness, pathwidth, and their application in natural language processing (Q1186169) (← links)
• The vertex separation number of a graph equals its path-width (Q1198094) (← links)
• Improved self-reduction algorithms for graphs with bounded treewidth (Q1336622) (← links)
• Helicopter search problems, bandwidth and pathwidth (Q1392549) (← links)
• Searching and pebbling (Q1821562) (← links)
• Vertex ordering and partitioning problems for random spatial graphs. (Q1884828) (← links)
• Connections between cutting-pattern sequencing, VLSI design, and flexible machines (Q1941954) (← links)
• On tradeoffs between width- and fill-like graph parameters (Q1999998) (← links)
• An experimental comparison of Variable Neighborhood Search variants for the minimization of the vertex-cut in layout problems (Q2840753) (← links)
• Fixed-Parameter Tractability of Treewidth and Pathwidth (Q2908539) (← links)
• Topological Bandwidth (Q3691781) (← links)
• An Application of Generalized Tree Pebbling to Sparse Matrix Factorization (Q3773170) (← links)
• Graph layout problems (Q5096816) (← links)
• Linear ordering based MIP formulations for the vertex separation or pathwidth problem (Q5915912) (← links)