Finding Well-Balanced Pairs of Edge-Disjoint Trees in Edge-Weighted Graphs

Jørgen Bang-Jensen
, Daniel Goncalves
, Inge Li Gørtz

Research output: Contribution to journal › Journal article › Research › peer-review

Overview
Fingerprint

Fingerprint

Dive into the research topics of 'Finding Well-Balanced Pairs of Edge-Disjoint Trees in Edge-Weighted Graphs'. Together they form a unique fingerprint.

Sort by

Weight
Alphabetically

Keyphrases

Computer Science

Mathematics

Powered by Pure Link opens in a new tab, Scopus Link opens in a new tab & Elsevier Fingerprint Engine™ Link opens in a new tab

All content on this site: Copyright © 2026 Welcome to DTU Research Database, its licensors, and contributors. All rights are reserved, including those for text and data mining, AI training, and similar technologies. For all open access content, the relevant licensing terms apply

We use cookies to help provide and enhance our service and tailor content. By continuing you agree to the use of cookies

Welcome to DTU Research Database data protection policy Link opens in a new tab

About web accessibility Link opens in a new tab

Report vulnerability Link opens in a new tab