Titlebook: ;

postpartum

書目名稱影響因子(影響力)




書目名稱影響因子(影響力)學科排名




書目名稱網(wǎng)絡公開度




書目名稱網(wǎng)絡公開度學科排名




書目名稱被引頻次




書目名稱被引頻次學科排名




書目名稱年度引用




書目名稱年度引用學科排名




書目名稱讀者反饋




書目名稱讀者反饋學科排名

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.

無節(jié)奏