標(biāo)題: Titlebook: ; [打印本頁] 作者: 粘上 時(shí)間: 2025-3-21 18:34
書目名稱Graph Theory and Algorithms影響因子(影響力)
書目名稱Graph Theory and Algorithms影響因子(影響力)學(xué)科排名
書目名稱Graph Theory and Algorithms網(wǎng)絡(luò)公開度
書目名稱Graph Theory and Algorithms網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Graph Theory and Algorithms被引頻次
書目名稱Graph Theory and Algorithms被引頻次學(xué)科排名
書目名稱Graph Theory and Algorithms年度引用
書目名稱Graph Theory and Algorithms年度引用學(xué)科排名
書目名稱Graph Theory and Algorithms讀者反饋
書目名稱Graph Theory and Algorithms讀者反饋學(xué)科排名
作者: incubus 時(shí)間: 2025-3-21 22:29
Sang-Ho Lee,Junseok Bae,Sang-Hyeop JeonA simple linear algorithm is presented for coloring planar graphs with at most five colors. The algorithm employs a recursive reduction of a graph involving the deletion of a vertex of degree 6 or less possibly together with the identification of its several neighbors.作者: 重畫只能放棄 時(shí)間: 2025-3-22 01:45 作者: 忙碌 時(shí)間: 2025-3-22 07:02 作者: 記憶 時(shí)間: 2025-3-22 10:00
https://doi.org/10.1007/978-3-642-02862-5Several intersection graphs such as curves-in-the-plane graphs, circular-arc graphs, chordal graphs and interval graphs are reviewed, especially on their recognition algorithms. In this connection graph realization problem is mentioned.作者: orthodox 時(shí)間: 2025-3-22 14:12
https://doi.org/10.1007/978-1-4419-0950-3This paper describes an efficient algorithm to find a Hamiltonian circuit in an arbitrary 4-connected maximal planar graph. The algorithm is based on our simlplified version of Whitney‘s proof of his theorem: every 4-connected maximal planar graph has a Hamiltonian circuit.作者: orthodox 時(shí)間: 2025-3-22 18:03 作者: PANEL 時(shí)間: 2025-3-22 23:49
A linear algorithm for five-coloring a planar graph,A simple linear algorithm is presented for coloring planar graphs with at most five colors. The algorithm employs a recursive reduction of a graph involving the deletion of a vertex of degree 6 or less possibly together with the identification of its several neighbors.作者: 代替 時(shí)間: 2025-3-23 02:50 作者: Indict 時(shí)間: 2025-3-23 07:48 作者: Sedative 時(shí)間: 2025-3-23 13:30
Algorithms for some intersection graphs,Several intersection graphs such as curves-in-the-plane graphs, circular-arc graphs, chordal graphs and interval graphs are reviewed, especially on their recognition algorithms. In this connection graph realization problem is mentioned.作者: outset 時(shí)間: 2025-3-23 17:02 作者: 預(yù)防注射 時(shí)間: 2025-3-23 21:28
The two disjoint path problem and wire routing design,A new polynomial time algorithm is presented for finding two vertex-disjoint paths between two specified pairs of vertices on an undirected graph. An application of the two disjoint path algorithm to the automatic wire routing is also discussed.作者: Assault 時(shí)間: 2025-3-24 00:38 作者: dissent 時(shí)間: 2025-3-24 04:20 作者: gerontocracy 時(shí)間: 2025-3-24 08:24 作者: 消耗 時(shí)間: 2025-3-24 13:42
https://doi.org/10.1007/978-3-658-45025-0alities concentrate in the "dual graph", wherefrom confusion is sometimes given rise to. The importance is illustrated by "new" theorems and concepts which are derived by understanding correctly the difference of the concepts.作者: 清真寺 時(shí)間: 2025-3-24 18:29
https://doi.org/10.1007/978-94-011-2759-2s of central trees have been clarified. In this paper, in connection with the critical sets of the edge set of a graph, some new theorems on central trees of the graph are presented. Also, a few examples are included to illustrate the applications of these theorems.作者: Pepsin 時(shí)間: 2025-3-24 21:05
https://doi.org/10.1007/978-3-658-37708-3s for characterizing the polyhex graphs are described and discussed, including the topological index, characteristic polynomial, sextet polvnomial, etc. Enumeration of the number of the maximum matching (or Kekulé patterns) is also discussed.作者: boisterous 時(shí)間: 2025-3-25 00:00
On the layering problem of multilayer PWB wiring, the special case of street capacities up to two in each layer, and it is reduced to a problem of the interval graph by relaxing some restrictions in the original problem. Then, a heuristic algorithm is proposed for this problem.作者: 燦爛 時(shí)間: 2025-3-25 06:40 作者: Brittle 時(shí)間: 2025-3-25 08:45
Combinatorial problems on series-parallel graphs,These include (i) the decision problem, and (ii) the minimum edge (vertex) deletion problem both with respect to a property characterized by a finite number of forbidden graphs, and (iii) the generalized matching problem.作者: SHRIK 時(shí)間: 2025-3-25 13:31 作者: DUCE 時(shí)間: 2025-3-25 16:59 作者: Exploit 時(shí)間: 2025-3-25 23:05
Characterization of polyhex graphs as applied to chemistry,s for characterizing the polyhex graphs are described and discussed, including the topological index, characteristic polynomial, sextet polvnomial, etc. Enumeration of the number of the maximum matching (or Kekulé patterns) is also discussed.作者: GULLY 時(shí)間: 2025-3-26 02:38 作者: Comedienne 時(shí)間: 2025-3-26 05:52 作者: Osteoporosis 時(shí)間: 2025-3-26 10:18 作者: 疏忽 時(shí)間: 2025-3-26 14:05
Minimally Invasive Total Joint Arthroplastyhe vertices classified according to the distance from a given vertex. Some fundamental properties of the centrality functions and the set of central vertices are summarized. Inserting an edge between a center and a vertex, the stability of the set of central vertices are investigated..For a weakly c作者: Inflammation 時(shí)間: 2025-3-26 16:58
https://doi.org/10.1007/978-1-4939-1317-6. We examine the structures of symmetric submodular systems and provide a decomposition theory of symmetric submodular systems. The theory is a generalization of the decomposition theory of 2-connected graphs developed by W. T. Tutte.作者: Mangle 時(shí)間: 2025-3-27 00:08 作者: ULCER 時(shí)間: 2025-3-27 03:18
https://doi.org/10.1007/978-3-030-57219-8hm tests the subgraph of the given graph G for planarity and if the subgraph fails the test, it deletes a minimum number of edges necessary for planarization. The subgraph has one vertex at the beginning, and the number of its vertices is increased one by one until all the vertices of G are included作者: maladorit 時(shí)間: 2025-3-27 07:15 作者: 過于平凡 時(shí)間: 2025-3-27 11:44
https://doi.org/10.1007/978-94-011-2759-2s of central trees have been clarified. In this paper, in connection with the critical sets of the edge set of a graph, some new theorems on central trees of the graph are presented. Also, a few examples are included to illustrate the applications of these theorems.作者: 無能力之人 時(shí)間: 2025-3-27 16:20 作者: aerial 時(shí)間: 2025-3-27 20:12 作者: kindred 時(shí)間: 2025-3-28 01:57 作者: Surgeon 時(shí)間: 2025-3-28 04:18
A status on the linear arboricity,riant first arose in a study [10] of information retrieval in file systems. A quite similar covering invariant which is well known to the linear arboricity is the . of a graph, which is defined as the minimum number of forests whose union is G. Nash-Williams [11] determined the arboricity of any gra作者: enfeeble 時(shí)間: 2025-3-28 06:18
On centrality functions of a graph,he vertices classified according to the distance from a given vertex. Some fundamental properties of the centrality functions and the set of central vertices are summarized. Inserting an edge between a center and a vertex, the stability of the set of central vertices are investigated..For a weakly c作者: adduction 時(shí)間: 2025-3-28 13:12
Canonical decompositions of symmetric submodular systems,. We examine the structures of symmetric submodular systems and provide a decomposition theory of symmetric submodular systems. The theory is a generalization of the decomposition theory of 2-connected graphs developed by W. T. Tutte.作者: Alpha-Cells 時(shí)間: 2025-3-28 16:10
Combinatorial problems on series-parallel graphs,These include (i) the decision problem, and (ii) the minimum edge (vertex) deletion problem both with respect to a property characterized by a finite number of forbidden graphs, and (iii) the generalized matching problem.作者: 極為憤怒 時(shí)間: 2025-3-28 19:45 作者: 舉止粗野的人 時(shí)間: 2025-3-29 00:20
"Dualities" in graph theory and in the related fields viewed from the metatheoretical standpoint,alities concentrate in the "dual graph", wherefrom confusion is sometimes given rise to. The importance is illustrated by "new" theorems and concepts which are derived by understanding correctly the difference of the concepts.作者: condescend 時(shí)間: 2025-3-29 05:46
On central trees of a graph,s of central trees have been clarified. In this paper, in connection with the critical sets of the edge set of a graph, some new theorems on central trees of the graph are presented. Also, a few examples are included to illustrate the applications of these theorems.作者: 不可比擬 時(shí)間: 2025-3-29 08:18
Characterization of polyhex graphs as applied to chemistry,s for characterizing the polyhex graphs are described and discussed, including the topological index, characteristic polynomial, sextet polvnomial, etc. Enumeration of the number of the maximum matching (or Kekulé patterns) is also discussed.作者: Diaphragm 時(shí)間: 2025-3-29 13:21
Some common properties for regularizable graphs, edge-critical graphs and b-graphs,作者: 新娘 時(shí)間: 2025-3-29 17:17
Celestino Pio Lombardi,Rocco Bellantoneided into unidirectional blocks. However, it is possible to divide a system into almost unidirectional blocks B. B. ... B. ... B. such that the existence of failure in B. will interfare only slightly to the performance of preceding blocks B. B. ... B..作者: gout109 時(shí)間: 2025-3-29 23:43 作者: 凹槽 時(shí)間: 2025-3-30 01:46
A status on the linear arboricity,icity is the . of a graph, which is defined as the minimum number of forests whose union is G. Nash-Williams [11] determined the arboricity of any graph, however only few results on the linear arboricity are known. We shall present these discoveries and an open problem on this new invariant.作者: BROTH 時(shí)間: 2025-3-30 07:32 作者: Cirrhosis 時(shí)間: 2025-3-30 11:45 作者: 果仁 時(shí)間: 2025-3-30 12:48 作者: microscopic 時(shí)間: 2025-3-30 19:41
https://doi.org/10.1007/978-3-030-57219-8 in it. The result from the application of the algorithm to random graphs indicates that the time complexity of the algorithm is O(n.) with p=1.4≈1.5 in average, where n is the number of verticles of G.作者: 創(chuàng)作 時(shí)間: 2025-3-31 00:23
A graph-planarization algorithm and its application to random graphs, in it. The result from the application of the algorithm to random graphs indicates that the time complexity of the algorithm is O(n.) with p=1.4≈1.5 in average, where n is the number of verticles of G.作者: 勉強(qiáng) 時(shí)間: 2025-3-31 03:48 作者: Invertebrate 時(shí)間: 2025-3-31 08:19 作者: Rankle 時(shí)間: 2025-3-31 09:33 作者: STING 時(shí)間: 2025-3-31 16:35
Use of Genetic Programming in the Identification of Rational Model Structures which has the aim of tunning the coefficients to the “true” values, these parameters are then correctly computed. This approach is based upon the well-known NARMAX model representation, widely used in non-linear system identification.作者: 權(quán)宜之計(jì) 時(shí)間: 2025-3-31 18:25
che Kirche opponierte in Deutschland lange gegen die Demokratisierung und idealisierte die Monarchie bis zur Kirchenspaltung durch Hitler. Mit der Bundesrepublik erwies sich nur jenes System als stabil, das frühzeitig die Loyalit?t beider Konfessionen genoss..978-3-658-11507-4978-3-658-11508-1作者: kidney 時(shí)間: 2025-3-31 22:44 作者: 意外 時(shí)間: 2025-4-1 03:02
Periocular Recognition Under Unconstrained Conditions Using CNN-Based Super-Resolution,usion that these attributes in the literature are the best descriptors for the periocular region. One possible solution to achieve better recognition performance is to employ the latest trends in deep learning. Accordingly, we propose to apply deep learning-based super-resolution technique to the pe作者: 聯(lián)想記憶 時(shí)間: 2025-4-1 09:08 作者: 好忠告人 時(shí)間: 2025-4-1 13:39 作者: 多嘴 時(shí)間: 2025-4-1 14:52
https://doi.org/10.1007/978-3-662-03366-1Keynes; agents; automata; behavior; control; economic growth; evolution; learning; memory; modeling; mutation; 作者: overhaul 時(shí)間: 2025-4-1 21:57
