A Framework for Network Reliability Problems on Graphs of Bounded Treewidth
ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
An exact method for graph coloring
Computers and Operations Research
New lower and upper bounds for graph treewidth
WEA'03 Proceedings of the 2nd international conference on Experimental and efficient algorithms
A memory efficient algorithm for network reliability
APCC'09 Proceedings of the 15th Asia-Pacific conference on Communications
Computing diameter constrained reliability of a network with junction points
Automation and Remote Control
Calculating two-terminal reliability in a diameter constrained network with cutnodes
Proceedings of the 6th International Conference on Ubiquitous Information Management and Communication
Decomposing graph with 2-node cuts for diameter constrained network reliability calculation
Proceedings of the 7th International Conference on Ubiquitous Information Management and Communication
Comparison of binary and multi-variate hybrid decision diagram algorithms for k-terminal reliability
ACSC '11 Proceedings of the Thirty-Fourth Australasian Computer Science Conference - Volume 113
| Hi-index | 0.00 |