Concepedia

Minimum Spanning Tree Simplification

Minimum Spanning Tree Simplification is a graph simplification method that reduces a connected, edge-weighted graph to its minimal subgraph containing all vertices and without cycles, preserving connectivity while minimizing total edge weight.

1

Publications

292

Citations

3

Authors

1

Institutions

Publications per year

2017–2026

0

Parents

Publications

1

1–1 of 1

Authors

3

  1. VO
    Victor Olman

    University of Georgia, United States

    1 publications · 292 citations

    1

    h-index

  2. YX
    Ying Xu

    University of Georgia, United States

    1 publications · 292 citations

    1

    h-index

  3. DX
    Dong Xu

    University of Missouri, United States

    1 publications · 292 citations

    1

    h-index

1–3 of 3

Institutions

1

  1. Oak Ridge National Laboratory

    Oak Ridge, United States

    1 h-index

    3 publications

    876 citations

1–1 of 1

Venues

  1. Bioinformatics

    1 publications · 292 citations

    1

    h-index

1–1