Titlebook: ;

联合

https://doi.org/10.1007/978-1-349-86076-0total number of fibers necessary to establish a given set of requests with a bounded number . of wavelengths, and the problem of maximizing the number of accepted requests for given fibers and bounded number . of wavelengths. We study both problems in undirected tree networks .=(.,.) and present app

厌烦

Matching, Edge-Colouring, and Dimers the dimer constant. Main results are improved complexity bounds for finding a perfect matching in a regular bipartite graph and for edge-colouring bipartite graphs, the solution of a problem of Erdős and Rényi concerning lower bounds for the number of perfect matchings, and an improved lower bound

预兆好

Minimum Flow Time Graph Ordering. A linear layout of the vertices corresponds then to a production schedule, and one wants to find a layout minimizing the average completion time of the jobs. We prove that the problem is NP-hard in general and is polynomial on trees. We then provide a 2-approximate algorithm and investigate necess

摘要记录

Searching Is Not Jumpingaph, using searchers; an edge is clear if it cannot contain the searched entity, contaminated otherwise. The . of a graph . is the smallest number of searchers required to “clear” .. A search strategy is . (.) if no recontamination ever occurs. It is . (.) if the set of clear edges always forms a co

PON

Foreknowledge

vasospasm

Compass

Canonical Decomposition of Outerplanar Maps and Application to Enumeration, Coding, and Generationible in linear time, implies the existence of bijection between rooted outerplanar maps with . nodes and bicolored rooted ordered trees with . nodes where all the nodes of the last branch are colored white. As a consequence, for rooted outerplanar maps of . nodes, we derive:

下边深陷

高度

Tree Spanners for Bipartite Graphs and Probe Interval Graphsn .. The tree .-spanner problem asks whether a graph admits a tree .-spanner, given .. We first substantially strengthen the known results for bipartite graphs. We prove that the tree .-spanner problem is .-complete even for chordal bipartite graphs for . ≥ 5, and every bipartite ATE–free graph has