A new approach to near-optimal path assignment through electric-circuit modeling
- 作者Howard A. Smolleck; Mo-Shing Chen
- 卷第11卷
- 期第4期
- 印刷ISSN0028-3045
- 电子ISSN1097-0037
- 文件大小810.71KB
- 发表时间1981
- DOI10.1002/net.3230110403
- 页码335-349
On subminimal cycle bases of a graph for the force methodA. Kaveh · Computers & Structures · 1988
[North-Holland Mathematics Studies] Random Graphs '83, Based on lectures presented at the 1st Poznań Seminar on Random Graphs Volume 118 || A New Version of the Solution of a Problem of Erdös and Rényi on Hamiltonian Cycles in Undirected GraphsKorshunov, Aleksej D. · 1985
AIP Conference Proceedings [AIP THE 5TH INTERNATIONAL CONFERENCE ON RESEARCH AND EDUCATION IN MATHEMATICS: ICREM5 - Bandung, Indonesia (22–24 October 2011)] - A characterization of the corona product of a cycle with some graphs based on its f-chromatic indexAdiwijaya, ; Salman, A. N. M.; Suprijanto, Djoko; Baskoro, Edy Tri · 2012
[IEEE Comput. Soc. Press [1992] Fifth International Workshop on Computer-Aided Software Engineering - Montreal, Que., Canada (6-10 July 1992)] [1992] Proceedings of the Fifth International Workshop on Computer-Aided Software Engineering - A graph-based approach to the construction of tools for the life cycle integration between software documentsWestfechtel, B. · 1992
[ASME ASME 2005 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference - Long Beach, California, USA (September 24–28, 2005)] Volume 5b: Power Transmission and Gearing Conference - A General Method of Kinematic Analysis of Parallel Axes Epicyclic Gear Trains Based on Graph-Cycle Matroid TheoryTalpasanu, Ilie; Yih, T. C.; Simionescu, P. A. · 2005
[IEEE Comput. Soc Sixth IEEE International Workshop on Distributed Simulation and Real-Time Applications - Fort Worth, TX, USA (11-13 Oct. 2002)] Proceedings. Sixth IEEE International Workshop on Distributed Simulation and Real-Time Applications - An implementation of a distributed algorithm for detection of local knots and cycles in directed graphs based on the CSP model and Javade Souza, G.P.; Pfitscher, G.H. · 2002
Hamiltonicity of AmalgamsArthur M. Farley; Andrzej Proskurowski; Mirosława Skowrońska; Maciej M. Sysło · Graphs and Combinatorics · 1999
Dominating cycles in halin graphsMirosława Skowrońska; Maciej M. Sysło · 1990
Some properties of graph centroidsW. Piotrowski; M. M. Sysło · 1991
Computational experiences with some transitive closure algorithmsM. M. Sysło; J. Dzikiewicz · 1975
An algorithm to recognize a middle graphMirosława Skowrońska; Maciej M. Sysło · 1984
Characterizations of outerplanar graphsMaciej M. Sysło · 1979
Optimal constructions of reversible digraphsMaciej M. Sysło · 1984