Titlebook: ;

Foolproof

CHAFE

稱贊

同來核對

透明

The Maximum Time of 2-neighbour Bootstrap Percolation in Grid Graphs and Parametrized Resultsn infected forever and in consecutive rounds healthy vertices with at least two already infected neighbors become infected. Percolation occurs if eventually every vertex is infected. The maximum time .(.) is the maximum number of rounds needed to eventually infect the entire vertex set. In 2013, it

小溪

Minimum Eccentricity Shortest Paths in Some Structured Graph Classest is NP-hard in general graphs, we demonstrate that a minimum eccentricity shortest path can be found in linear time for distance-hereditary graphs (generalizing the previous result for trees) and in . time for chordal graphs.

短程旅游

Approximating Source Location and Star Survivable Network Problems . of .. In many . problems . if ., so the demand of nodes selected to . is completely satisfied. In a variant suggested recently by Fukunaga [.], every node . selected to . gets a “bonus” ., and . if . and . otherwise, where . is the maximum number of internally disjoint (.,?.)-paths. While the app

IRS

uncertain

https://doi.org/10.1007/978-3-658-04680-4that . for every edge?.. We survey known results on the computational complexity of . for graph classes that are hereditary or for which some graph parameter is bounded. We also consider coloring variants, such as precoloring extensions and list colorings and give some open problems in the area of on-line coloring.

SPER

https://doi.org/10.1007/978-3-322-87480-1r several optimization problems. They include offline and online scenarios, and concern problems that optimize the use of components in the optical networks, specifically Add-Drop Multiplexers (ADMs) and regenerators.