Edge-disjoint minimum-weight connected spanning k-edge subgraphs in a weighted graph: A connectedness theorem

Xueliang Li

doi:10.1016/s0012-365x(97)00253-7

ScienceGate Book Chapters

JOURNAL ARTICLE

Edge-disjoint minimum-weight connected spanning k-edge subgraphs in a weighted graph: A connectedness theorem

Xueliang Li

Year: 1998 Journal: Discrete Mathematics Vol: 188 (1-3)Pages: 175-182 Publisher: Elsevier BV

DOI: 10.1016/s0012-365x(97)00253-7

Get Full-Text PDF Get Analytical Report

Keywords:

Combinatorics Mathematics Spanning tree Disjoint sets Social connectedness Discrete mathematics Minimum weight Enhanced Data Rates for GSM Evolution Computer science

Metrics

Cited By

0.00

FWCI (Field Weighted Citation Impact)

Refs

0.22

Citation Normalized Percentile

Is in top 1%

Is in top 10%

Topics

Advanced Graph Theory Research

Physical Sciences → Computer Science → Computational Theory and Mathematics

Interconnection Networks and Systems

Physical Sciences → Computer Science → Computer Networks and Communications

graph theory and CDMA systems

Physical Sciences → Engineering → Electrical and Electronic Engineering

Edge-disjoint minimum-weight connected spanning k-edge subgraphs in a weighted graph: A connectedness theorem

Metrics

Topics

Related Documents

Edge‐disjoint spanning trees: A connectedness theorem

Distributed Approximation of Minimum k-edge-connected Spanning Subgraphs

Minimum Weight 2-Edge-Connected Spanning Subgraphs in Planar Graphs

Packing spanning trees and spanning 2-connected k-edge-connected essentially $$(2k-1)$$ ( 2 k - 1 ) -edge-connected subgraphs

Finding 2-edge connected spanning subgraphs