2020
DOI: 10.1360/ssm-2019-0266
|View full text |Cite
|
Sign up to set email alerts
|

Optimization of spanning tree stretch and congestion for graphs

Abstract: Laplacian spectrum analysis and spanning tree algorithm for circuit partitioning problems Science in China Series F-Information Sciences 46, 459 (2003); Asymptotic enumeration theorems for the numbers of spanning trees and Eulerian trails in circulant digraphs and graphs Science in China Series A-Mathematics 42, 264 (1999); A note on the tree decompositions of graphs

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

0
0
0

Year Published

2022
2022
2022
2022

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
references
References 21 publications
(33 reference statements)
0
0
0
Order By: Relevance