A variation on the min cut linear arrangement problem

Simonson, Shai

doi:10.1007/bf01692067

Cited by 18 publications

(10 citation statements)

References 17 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The spanning tree congestion of graphs has been studied intensively [2,3,4,5,6,7,8,9,10,11,12,13,14,15,16]. In this note, we study the spanning tree congestion of Hamming graphs.…”

Section: Preliminariesmentioning

confidence: 99%

On spanning tree congestion of graphs

Kozawa

Otachi

Yamazaki

2009

Discrete Mathematics

View full text Add to dashboard Cite

show abstract

“…The spanning tree congestion of graphs has been studied intensively [2,3,4,5,6,7,8,9,10,11,12,13,14,15,16]. In this note, we study the spanning tree congestion of Hamming graphs.…”

Section: Preliminariesmentioning

confidence: 99%

On spanning tree congestion of graphs

Kozawa

Otachi

Yamazaki

2009

Discrete Mathematics

View full text Add to dashboard Cite

show abstract

“…We use the following definitions introduced in [Ost04] (some of them were known before, see [Sim87]). Let T be a spanning tree in G. The spanning tree congestion of G is…”

Section: Congestion and Stretchmentioning

confidence: 99%

Quantitative characteristics of cycles and their relations with stretch and spanning tree congestion

Catrina¹,

Khan²,

Moorman³

et al. 2021

Preprint

View full text Add to dashboard Cite

The main goal of this article is to introduce new quantitative characteristics of cycles in finite simple connected graphs and to establish relations of these characteristics with the stretch and spanning tree congestion of graphs. The main new parameter is named the support number. We give a polynomial approximation algorithm for the support number with the aid of yet another characteristic we introduce, named the cycle width of the graph.

show abstract

“…The spanning tree congestion has been studied intensively [4,5,8,9,12,10,16,15,17,18]. Castejón and Ostrovskii [5], and Hruska [8] independently determined the spanning tree congestion of the two-dimensional grid P m P n .…”

Section: Introductionmentioning

confidence: 99%

Spanning tree congestion of rook's graphs

Kozawa¹,

Otachi²

2011

Discuss. Math. Graph Theory

View full text Add to dashboard Cite

Let G be a connected graph and T be a spanning tree of G. For e ∈ E(T), the congestion of e is the number of edges in G joining the two components of T − e. The congestion of T is the maximum congestion over all edges in T. The spanning tree congestion of G is the minimum congestion over all its spanning trees. In this paper, we determine the spanning tree congestion of the rook's graph K m K n for any m and n.

show abstract

A variation on the min cut linear arrangement problem

Cited by 18 publications

References 17 publications

On spanning tree congestion of graphs

On spanning tree congestion of graphs

Quantitative characteristics of cycles and their relations with stretch and spanning tree congestion

Spanning tree congestion of rook's graphs

Contact Info

Product

Resources

About