標題: Titlebook: Computational Graph Theory; G. Tinhofer,E. Mayr,M. M. Syslo Book 1990 Springer-Verlag/Wien 1990 Layout.algorithms.calculus.computational g [打印本頁] 作者: 方言 時間: 2025-3-21 20:06
書目名稱Computational Graph Theory影響因子(影響力)
書目名稱Computational Graph Theory影響因子(影響力)學科排名
書目名稱Computational Graph Theory網絡公開度
書目名稱Computational Graph Theory網絡公開度學科排名
書目名稱Computational Graph Theory被引頻次
書目名稱Computational Graph Theory被引頻次學科排名
書目名稱Computational Graph Theory年度引用
書目名稱Computational Graph Theory年度引用學科排名
書目名稱Computational Graph Theory讀者反饋
書目名稱Computational Graph Theory讀者反饋學科排名
作者: FLIT 時間: 2025-3-21 22:14
Jitka Dupa?ová,Jan Hurt,Josef ?těpánarrays, and Weinberger arrays. These include a variety of mostly independently investigated graph problems such as augmentation of a given graph to an interval graph with small clique size, node search of graphs, matching problems with side constraints, and other. We discuss implications of graph th作者: 才能 時間: 2025-3-22 02:11
Stochastic Modeling in Economics and Financeanarity testing, embedding, drawing, separators, vertex-coloring, independent vertex set, listing subgraphs, Hamiltonian cycle, network flows, and Steiner trees and forests. Also typical methods and techniques useful for computational problems on planar graphs are discussed. Furthermore open questio作者: 粗鄙的人 時間: 2025-3-22 04:38 作者: 衰弱的心 時間: 2025-3-22 11:48
Kazimierz Sobczyk,David J. Kirkneralgorithm to find transitive orientations of graphs where they exist. Both algorithms together solve the maximum clique problem and the minimum coloring problem for comparability graphs, and the maximum matching problem for co-comparability graphs. The transitive orientation algorithm can also be us作者: 吞下 時間: 2025-3-22 14:33 作者: 吞下 時間: 2025-3-22 19:22
Stochastic Modelling and Filteringmes that the problem instances are randomly selected from some reasonable distribution of problems. We consider two types of problem. The first sort is polynomially solvable in the worst case but there are algorithms with better average case performance. In particular we consider the all-pairs short作者: 泰然自若 時間: 2025-3-22 22:17 作者: cajole 時間: 2025-3-23 04:42
V. I. Klyatskin,W. A. Woyczynski,D. Gurariectures. Such embeddings can be viewed as high level descriptions of efficient methods to simulate an algorithm designed for one type of parallel machine on a different network structure and/or techniques to distribute data/program variables to achieve optimum use of all available processors...: 68Q1作者: Amenable 時間: 2025-3-23 06:25 作者: engender 時間: 2025-3-23 13:18
Embedding one Interconnection Network in Another,ctures. Such embeddings can be viewed as high level descriptions of efficient methods to simulate an algorithm designed for one type of parallel machine on a different network structure and/or techniques to distribute data/program variables to achieve optimum use of all available processors...: 68Q10, 94’02, 94C15.作者: Duodenitis 時間: 2025-3-23 16:51 作者: Conflagration 時間: 2025-3-23 19:00
Computational Graph Theory978-3-7091-9076-0Series ISSN 0344-8029 作者: TRAWL 時間: 2025-3-24 01:53 作者: troponins 時間: 2025-3-24 03:06 作者: 花爭吵 時間: 2025-3-24 09:11 作者: adroit 時間: 2025-3-24 11:40
https://doi.org/10.1007/978-3-319-12877-1.. Classical and recent results are surveyed in the development of efficient representations of dynamic partial orders by heaps and their generalizations...: 68B15, 06A10.作者: CLAN 時間: 2025-3-24 16:22 作者: 神圣不可 時間: 2025-3-24 20:04 作者: sinoatrial-node 時間: 2025-3-25 00:21
Orders and Graphs,Orders and Graphs. This paper surveys the relationship between graphtheoretic and ordertheoretic questions. In the first part, we discuss recent results which answer ordertheoretic questions in a more general graphtheoretic framework. In the second part we address ordertheoretic approaches to graph-theoretic problems...: 05C20, 05C25, 06A10.作者: 懶惰民族 時間: 2025-3-25 05:11 作者: 雕鏤 時間: 2025-3-25 08:14 作者: 安心地散步 時間: 2025-3-25 13:40 作者: conflate 時間: 2025-3-25 16:35 作者: collagen 時間: 2025-3-25 20:07
978-3-211-82177-0Springer-Verlag/Wien 1990作者: 杠桿支點 時間: 2025-3-26 03:51 作者: Generalize 時間: 2025-3-26 07:22 作者: Mortar 時間: 2025-3-26 09:04 作者: 盟軍 時間: 2025-3-26 16:12
Book 1990, and that standard results in graph theory are often very relevant to the solution of problems concerning them. As a consequence, a tremendous number of publications has appeared, dealing with graphtheoretical problems from a computational point of view or treating computational problems using grap作者: enfeeble 時間: 2025-3-26 17:43
Jitka Dupa?ová,Jan Hurt,Josef ?těpáneoretic results for the VLSI layout problems and survey new research directions. New results presented include NP-hardness of gate matrix layout on chordal graphs, efficient algorithms for trees, cographs, and certain chordal graphs, Lagrangean relaxation and approximation algorithms based on on-line interval graph augmentation.作者: evanescent 時間: 2025-3-26 23:25
0344-8029 for structural relations, graphs have turned out to provide the most appropriate tool for setting up the mathematical model. This is certainly one of the reasons for the rapid expansion in graph theory during the last decades. Furthermore, in recent years it also became clear that the two disciplin作者: MONY 時間: 2025-3-27 01:42
Stochastic Modeling in Economics and Financeiner trees and forests. Also typical methods and techniques useful for computational problems on planar graphs are discussed. Furthermore open questions on planar graphs are mentioned..AMS Subject Classification: 05.作者: outrage 時間: 2025-3-27 07:39
Kazimierz Sobczyk,David J. Kirknerng problem for comparability graphs, and the maximum matching problem for co-comparability graphs. The transitive orientation algorithm can also be used to identify permutation graphs, another important subclass of perfect graphs...: 68C15, 68E10, 68Q10.作者: 補助 時間: 2025-3-27 10:39 作者: esculent 時間: 2025-3-27 15:45 作者: Confirm 時間: 2025-3-27 18:43 作者: 金桌活畫面 時間: 2025-3-28 01:52 作者: Ptosis 時間: 2025-3-28 04:01
https://doi.org/10.1007/978-94-009-4828-0ion among these problems and their common algebraic foundation..We survey algorithms for solving them: vertex elimination algorithms such as Gau?-Jordan elimination; and iterative algorithms such as the “classical” Jacobi and Gau?-Seidel iteration....: 68–01, (68E10, 68R10, 68Q, 05C, 65-01, 65F05, 65F10, 16A78, 90C35, 90C50).作者: degradation 時間: 2025-3-28 09:52
Stochastic Modelling and Filteringsider three NP-Complete problems; the Hamilton cycle problem, the graph bisection problem and graph colouring. In addition we consider the graph isomorphism problem whose exact complexity is still undetermined....: 68Q25, 05C8O.作者: BOOST 時間: 2025-3-28 14:02 作者: 改良 時間: 2025-3-28 14:53 作者: 驕傲 時間: 2025-3-28 22:22
Book 1990tural relations, graphs have turned out to provide the most appropriate tool for setting up the mathematical model. This is certainly one of the reasons for the rapid expansion in graph theory during the last decades. Furthermore, in recent years it also became clear that the two disciplines of grap作者: Uncultured 時間: 2025-3-29 02:07 作者: 摸索 時間: 2025-3-29 06:23
Efficient Computations in Tree-Like Graphs,gineering, computer science and operations research. In recent years, a generally accepted measure of a problem’s difficulty became a worst-case, asymptotic growth complexity characterization. Because of the anticipated at least exponential complexity of any solution algorithm for members in the cla作者: 分散 時間: 2025-3-29 10:05 作者: 他去就結束 時間: 2025-3-29 13:34
Planar Graph Problems,anarity testing, embedding, drawing, separators, vertex-coloring, independent vertex set, listing subgraphs, Hamiltonian cycle, network flows, and Steiner trees and forests. Also typical methods and techniques useful for computational problems on planar graphs are discussed. Furthermore open questio作者: Provenance 時間: 2025-3-29 15:59 作者: 親屬 時間: 2025-3-29 22:28 作者: arousal 時間: 2025-3-30 00:57
Path Problems in Graphs,course path problems in graphs such as the shortest path problem or problems of finding optimal paths with respect to more generally defined objective functions; but also graph problems whose formulations do not directly involve the concept of a path, such as finding all bridges and articulation poi作者: 演繹 時間: 2025-3-30 04:20
Probabilistic Analysis of Graph Algorithms,mes that the problem instances are randomly selected from some reasonable distribution of problems. We consider two types of problem. The first sort is polynomially solvable in the worst case but there are algorithms with better average case performance. In particular we consider the all-pairs short作者: Condyle 時間: 2025-3-30 09:51
Generating Graphs Uniformly at Random,starting procedures for uniform generation of several kinds of trees, arbitrary unlabelled graphs and various kinds of labelled graphs. Most of the material discussed in this paper has been developed during the last decade by several authors. In section 4.3 some recent results on the generation of o作者: MAIM 時間: 2025-3-30 15:45
