表示向前
发表于 2025-3-25 04:35:42
Trees and electrical networks,as follows: in the initial step we choose a cheapest edge, and in each subsequent step we choose one among the cheapest remaining edges with the restriction that the subgraph of . formed by the selected edges is acyclic.
CHARM
发表于 2025-3-25 07:50:56
Matroids,the theory of matroids. Moreover, matroids provide a basis for discrete optimization. Several important algorithms, for instance the greedy algorithm, belong to the matroid world. We make a notational agreement in this chapter: the graphs are allowed to have loops and multiple edges.
Spinal-Fusion
发表于 2025-3-25 13:00:29
http://reply.papertrans.cn/29/2812/281149/281149_23.png
BUMP
发表于 2025-3-25 18:29:45
Discrete Mathematics in Statistical Physics978-3-8348-9329-1Series ISSN 0932-7134 Series E-ISSN 2512-7039
巨大没有
发表于 2025-3-25 22:35:29
R. J. MacDonald,E. C. Taglauer,K. R. Wandeltas follows: in the initial step we choose a cheapest edge, and in each subsequent step we choose one among the cheapest remaining edges with the restriction that the subgraph of . formed by the selected edges is acyclic.
水獭
发表于 2025-3-26 00:08:07
https://doi.org/10.1007/978-3-642-80281-2the theory of matroids. Moreover, matroids provide a basis for discrete optimization. Several important algorithms, for instance the greedy algorithm, belong to the matroid world. We make a notational agreement in this chapter: the graphs are allowed to have loops and multiple edges.
Root494
发表于 2025-3-26 04:48:40
http://reply.papertrans.cn/29/2812/281149/281149_27.png
项目
发表于 2025-3-26 09:46:29
http://reply.papertrans.cn/29/2812/281149/281149_28.png
本能
发表于 2025-3-26 14:20:26
978-3-528-03219-7Vieweg+Teubner Verlag | Springer Fachmedien Wiesbaden GmbH, Wiesbaden 2010
使混合
发表于 2025-3-26 18:24:37
R. J. MacDonald,E. C. Taglauer,K. R. Wandeltas follows: in the initial step we choose a cheapest edge, and in each subsequent step we choose one among the cheapest remaining edges with the restriction that the subgraph of . formed by the selected edges is acyclic.