Computing Network Reliability with Diameter Constraints:Topologies and Instances with Polynomial-Time Complexity

Publisher： Nova Science Publishers, Inc.

ISSN： 1535-6698

Source： International Journal of Computer Research, Vol., Iss., 2015-07, pp. : 49-92

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Related content

A Polynomial-Time Algorithm for Computing the Maximum Common Connected Edge Subgraph of Outerplanar Graphs of Bounded Degree

By Akutsu Tatsuya   Tamura Takeyuki  

Algorithms, Vol. 6, Iss. 1, 2013-02 ,pp. : 119-135

MDPI

Access to resources Recommend Favorite

Exhaustive Enumeration of Kinetic Model Topologies for the Analysis of Time-Resolved RNA Folding

By Martin Joshua S.   Simmons Katrina   Laederach Alain  

Algorithms, Vol. 2, Iss. 1, 2009-02 ,pp. : 200-214

MDPI

Access to resources Recommend Favorite

Elastic Scheduling of Scientific Workflows under Deadline Constraints in Cloud Computing Environments

By Anwar Nazia   Deng Huifang  

Future Internet, Vol. 10, Iss. 1, 2018-01 ,pp. : 5-5

MDPI

Access to resources Recommend Favorite

Time Complexity of an Distributed Algorithm for Load Balancing of Microservice-oriented Applications in the Cloud

By  

ITM Web of conferences, Vol. 21, Iss. issue, 2018-10 ,pp. : 00018-00018

Edp Sciences

Access to resources Recommend Favorite

Measure and compare the convergence time of network routing protocols

By  

ITM Web of conferences, Vol. 21, Iss. issue, 2018-10 ,pp. : 00013-00013

Edp Sciences

Access to resources Recommend Favorite