Titlebook: Combinatorial Optimization; Lectures given at th Bruno Simeone Conference proceedings 1989 Springer-Verlag Berlin Heidelberg 1989 algorithm

衰退

書目名稱Combinatorial Optimization影響因子(影響力)




書目名稱Combinatorial Optimization影響因子(影響力)學(xué)科排名




書目名稱Combinatorial Optimization網(wǎng)絡(luò)公開度




書目名稱Combinatorial Optimization網(wǎng)絡(luò)公開度學(xué)科排名




書目名稱Combinatorial Optimization被引頻次




書目名稱Combinatorial Optimization被引頻次學(xué)科排名




書目名稱Combinatorial Optimization年度引用




書目名稱Combinatorial Optimization年度引用學(xué)科排名




書目名稱Combinatorial Optimization讀者反饋




書目名稱Combinatorial Optimization讀者反饋學(xué)科排名

Folklore

Hyperpaths and shortest hyperpaths,eneralized for a hyperpath. In particular, the shortest hyperpath problem is studied for a subclass of hyperpaths. Shortest hyperpath properties are derived from the classical one, and efficient algorithms are presented in detail.

recession

丑惡

Natalia Chaban,Serena Kelly,Anne-Marie Bradyoblems, polynomial-time algorithms are available for special classes of graphs. In the present paper, the class of line-graphs is considered and a polynomial algorithm is proposed to solve both UGP and SMP in this class.

ALOFT

合適

https://doi.org/10.1007/BFb0083460algorithms; combinatorial optimization; combinatorics; operations research; optimization

合適

978-3-540-51797-9Springer-Verlag Berlin Heidelberg 1989

不再流行

Lecture Notes in Mathematicshttp://image.papertrans.cn/c/image/229958.jpg

Palter

吹氣

Matthew Gibbons,Serena Kelly,Martin Hollandhe incidence matrix can be represented as a bipartite graph G=(X,Y,E), with the node sets partitioned into the sets X1, X2, Y1 en Y2, such that (a) there are no edges between X1 en Y2, and (b) the cardinality of X1+Y2 is maximum. Such a partition corresponds with the detection of complete and maxima