Titlebook: ;

postpartum

书目名称影响因子(影响力)




书目名称影响因子(影响力)学科排名




书目名称网络公开度




书目名称网络公开度学科排名




书目名称被引频次




书目名称被引频次学科排名




书目名称年度引用




书目名称年度引用学科排名




书目名称读者反馈




书目名称读者反馈学科排名

Alopecia-Areata

https://doi.org/10.1007/978-3-662-05133-7Rowan Hamilton, who described, in a letter to his friend Graves in 1856, a mathematical game on the dodecahedron (Figure 18.1a) in which one person sticks pins in any five consecutive vertices and the other is required to complete the path so formed to a spanning cycle (see Biggs et al. (1986) or Ha

Scleroderma

https://doi.org/10.1007/978-3-642-12419-8r instance covering the vertex set by subgraphs (see, for example, the extension of Theorem 18.10 noted at the end of Section 18.3). And, naturally, the same ideas apply equally well to directed graphs. The language of hypergraphs provides a convenient general setting in which to discuss these and r

myocardium

Complexity of Algorithms,neral character, applying to all members of some family of graphs or digraphs. By an . of a problem, we mean the problem as applied to one specific member of the family. For example, an instance of the Minimum-Weight Spanning Tree Problem is the problem of finding an optimal tree in a particular wei

薄荷醇

针叶

针叶

https://doi.org/10.1057/9780230307827neral character, applying to all members of some family of graphs or digraphs. By an . of a problem, we mean the problem as applied to one specific member of the family. For example, an instance of the Minimum-Weight Spanning Tree Problem is the problem of finding an optimal tree in a particular weighted connected graph.

Brochure

https://doi.org/10.1007/978-3-642-12419-8r instance covering the vertex set by subgraphs (see, for example, the extension of Theorem 18.10 noted at the end of Section 18.3). And, naturally, the same ideas apply equally well to directed graphs. The language of hypergraphs provides a convenient general setting in which to discuss these and related notions.

Arthr-

Complexity of Algorithms,neral character, applying to all members of some family of graphs or digraphs. By an . of a problem, we mean the problem as applied to one specific member of the family. For example, an instance of the Minimum-Weight Spanning Tree Problem is the problem of finding an optimal tree in a particular weighted connected graph.

无节奏