Finding minimal branchings with a given number of arcs
نویسندگان
چکیده
منابع مشابه
The minimal number with a given number of divisors
A number n is said to be ordinary if the smallest number with exactly n divisors is p q1−1 1 · · · p qa−1 a where q1 · · · qa is the prime factorization of n and q1 ≥ . . . ≥ qa (and where pk denotes the k-th prime). We show here that all square–free numbers are ordinary and that the set of ordinary numbers has natural density one.
متن کاملOn the Number of Minimal Surfaces with a given Boundary
In [TT78], Tomi and Tromba used degree theory to solve a longstanding problem about the existence of minimal surfaces with a prescribed boundary: they proved that every smooth, embedded curve on the boundary of a convex subset of R must bound an embedded minimal disk. Indeed, they proved that a generic such curve must bound an odd number of minimal embedded disks. White [Whi89] generalized thei...
متن کاملFinding optimum branchings
Chu and Liu, Ecbnonds, and Bock have independently devised an ef f ic ient aZgorYithm to f i n d an optimum branching i n a d i rected haph. runs i n O(m2ogn) time i f the problem graph has n vertices and m edges. A modification for dense graphs gives a running time 2 of O(n 1. We also show that the unmodified algorithm runs i n 2 O(n(Zog n) + m) time on an average graph, asswning a uniform pro...
متن کاملThe Minimal Number of Subtrees with a Given Degree Sequence
In this paper, we investigate the structures of extremal trees which have the minimal number of subtrees in the set of all trees with a given degree sequence. In particular, the extremal trees must be caterpillar and but in general not unique. Moreover, all extremal trees with a given degree sequence π = (d1, . . . , d5, 1, . . . , 1) have been characterized.
متن کاملOut-branchings with Extremal Number of Leaves
An out-tree T in a digraph D is subgraph of D which is an orientation of a tree that has only one vertex of in-degree 0 (root). A vertex of T is a leaf if it has out-degree 0. A spanning out-tree is called an out-branching. We’ll overview some recent algorithmic and theoretical results on out-branchings with minimum and maximum number of leaves.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: YUJOR
سال: 2002
ISSN: 0354-0243,1820-743X
DOI: 10.2298/yjor0201001c