Pages that link to "Item:Q1186169"
From MaRDI portal
The following pages link to Narrowness, pathwidth, and their application in natural language processing (Q1186169):
Displaying 12 items.
- Approximating the pathwidth of outerplanar graphs (Q293398) (← links)
- The complexity of minimum-length path decompositions (Q494076) (← links)
- Complexity of secure sets (Q722534) (← links)
- Helicopter search problems, bandwidth and pathwidth (Q1392549) (← links)
- Edge and node searching problems on trees (Q1575444) (← links)
- Connections between cutting-pattern sequencing, VLSI design, and flexible machines (Q1941954) (← links)
- Tailored heuristics in adaptive large neighborhood search applied to the cutwidth minimization problem (Q2029285) (← links)
- The theory of guaranteed search on graphs (Q2439841) (← links)
- Node-searching problem on block graphs (Q2462351) (← links)
- Treewidth in Non-Ground Answer Set Solving and Alliance Problems in Graphs (Q5240230) (← links)
- Graph searching on chordal graphs (Q6487435) (← links)
- Witnessing subsystems for probabilistic systems with low tree width (Q6649513) (← links)
