A Polynomial Time Algorithm for Steiner Tree When Terminals Avoid a Rooted K4-Minor

Carla Groenland*, Jesper Nederlof*, Tomohiro Koana*

*Corresponding author for this work

Research output: Chapter in Book/Conference proceedings/Edited volumeConference contributionScientificpeer-review

7 Downloads (Pure)

Fingerprint

Dive into the research topics of 'A Polynomial Time Algorithm for Steiner Tree When Terminals Avoid a Rooted K4-Minor'. Together they form a unique fingerprint.

INIS

Mathematics

Keyphrases