Pages that link to "Item:Q3766845"
From MaRDI portal
The following pages link to Solving NP-Hard Problems on Graphs That Are Almost Trees and an Application to Facility Location Problems (Q3766845):
Displayed 24 items.
- Backup 2-center on interval graphs (Q442280) (← links)
- Cycle-maximal triangle-free graphs (Q472981) (← links)
- A note on locating a central vertex of a 3-cactus graph (Q913638) (← links)
- A minimum length covering subgraph of a network (Q920001) (← links)
- Solving NP-hard problems in 'almost trees': vertex cover (Q1062757) (← links)
- The location of central structures in trees (Q1097827) (← links)
- Nonserial dynamic programming formulations of satisfiability (Q1099093) (← links)
- Locating an absolute center on graphs that are almost trees (Q1263510) (← links)
- The algorithmic use of hypertree structure and maximum neighbourhood orderings (Q1383368) (← links)
- An optimal algorithm for solving the 1-median problem on weighted 4-cactus graphs (Q1577108) (← links)
- A linear-time algorithm for solving the center problem on weighted cactus graphs (Q1606995) (← links)
- Algorithm to find a maximum 2-packing set in a cactus (Q1748991) (← links)
- Succinct data structures for series-parallel, block-cactus and 3-leaf power graphs (Q2150567) (← links)
- Control of Boolean networks: hardness results and algorithms for tree structured networks (Q2209150) (← links)
- Efficient algorithms for center problems in cactus networks (Q2371802) (← links)
- GLOUDS: representing tree-like graphs (Q2634715) (← links)
- Efficient Farthest-Point Queries in Two-terminal Series-parallel Networks (Q2827807) (← links)
- Approximability issues of guarding a set of segments (Q2855782) (← links)
- A finite algorithm for the continuousp-center location problem on a graph (Q3724065) (← links)
- Efficient algorithms for solving systems of linear equations and path problems (Q5096775) (← links)
- The backup 2‐center and backup 2‐median problems on trees (Q5191127) (← links)
- Exploiting Structure: Location Problems on Trees and Treelike Graphs (Q5506729) (← links)
- Covering edges in networks (Q6087399) (← links)
- The algorithmic use of hypertree structure and maximum neighbourhood orderings (Q6184359) (← links)