共 50 条
- [41] PROCEDURE FOR PARTITIONING THE NODES OF A GRAPH. IBM technical disclosure bulletin, 1986, 28 (09): : 4030 - 4034
- [42] Auction algorithm for shortest paths in road networks considering delays for intersection movements Xinan Jiaotong Daxue Xuebao/Journal of Southwest Jiaotong University, 2010, 45 (02): : 249 - 254
- [43] IDENTIFYING TEST FOR A NONDIRECTED GRAPH AUTOMATION AND REMOTE CONTROL, 1973, 34 (07) : 1175 - 1178
- [45] Shortest Paths between Shortest Paths and Independent Sets COMBINATORIAL ALGORITHMS, 2011, 6460 : 56 - +
- [46] Generation of Trees of a Linear Graph. Archiwum Elektrotechniki (Warsaw), 1975, 24 (02): : 263 - 276
- [50] Nonempty intersection of longest paths in a graph with a small matching number Czechoslovak Mathematical Journal, 2015, 65 : 545 - 553