Pages that link to "Item:Q1111019"
From MaRDI portal
The following pages link to Min Cut is NP-complete for edge weighted trees (Q1111019):
Displaying 35 items.
- On the complexity of the FIFO stack-up problem (Q261535) (← links)
- Computing directed pathwidth in \(O(1.89^n)\) time (Q300464) (← links)
- Variable neighborhood search for the vertex separation problem (Q339678) (← links)
- On cutwidth parameterized by vertex cover (Q476444) (← links)
- Computing the vertex separation of unicyclic graphs (Q596295) (← links)
- Exclusive graph searching vs. pathwidth (Q729824) (← links)
- Fixed-parameter algorithms for protein similarity search under mRNA structure constraints (Q1002106) (← links)
- Derivation of algorithms for cutwidth and related graph layout parameters (Q1015810) (← links)
- Representations of graphs and networks (coding, layouts and embeddings) (Q1174904) (← links)
- On the pathwidth of chordal graphs (Q1309811) (← links)
- Improved self-reduction algorithms for graphs with bounded treewidth (Q1336622) (← links)
- Treewidth for graphs with small chordality (Q1372729) (← links)
- Edge and node searching problems on trees (Q1575444) (← links)
- Scheduling series-parallel task graphs to minimize peak memory (Q1685958) (← links)
- Well quasi orders in subclasses of bounded treewidth graphs and their algorithmic applications (Q1759678) (← links)
- On the domination search number (Q1811076) (← links)
- A branch-and-bound algorithm for the minimum cut linear arrangement problem (Q1928510) (← links)
- Tailored heuristics in adaptive large neighborhood search applied to the cutwidth minimization problem (Q2029285) (← links)
- How to compute digraph width measures on directed co-graphs (Q2220888) (← links)
- On the hardness of palletizing bins using FIFO queues (Q2330097) (← links)
- On sparsification for computing treewidth (Q2343087) (← links)
- Efficient reassembling of graphs. I: The linear case (Q2359807) (← links)
- The theory of guaranteed search on graphs (Q2439841) (← links)
- Node-searching problem on block graphs (Q2462351) (← links)
- Lower bounds on the pathwidth of some grid-like graphs (Q2476243) (← links)
- On Cutwidth Parameterized by Vertex Cover (Q2891354) (← links)
- Packing of (0, 1)-matrices (Q3423133) (← links)
- DECONTAMINATING CHORDAL RINGS AND TORI USING MOBILE AGENTS (Q3444846) (← links)
- Directed Pathwidth and Palletizers (Q3467832) (← links)
- Visibility-based pursuit-evasion in a polygonal environment (Q5096922) (← links)
- Experimental Evaluation of a Branch-and-Bound Algorithm for Computing Pathwidth and Directed Pathwidth (Q5266611) (← links)
- Pathwidth is NP-Hard for Weighted Trees (Q5321709) (← links)
- Characterizations and directed path-width of sequence digraphs (Q6038712) (← links)
- On the complexity of the storyplan problem (Q6078287) (← links)
- Graph searching on chordal graphs (Q6487435) (← links)
