書目名稱Graph-Theoretic Concepts in Computer Science影響因子(影響力)學科排名
書目名稱Graph-Theoretic Concepts in Computer Science網(wǎng)絡公開度
書目名稱Graph-Theoretic Concepts in Computer Science網(wǎng)絡公開度學科排名
書目名稱Graph-Theoretic Concepts in Computer Science被引頻次
書目名稱Graph-Theoretic Concepts in Computer Science被引頻次學科排名
書目名稱Graph-Theoretic Concepts in Computer Science年度引用
書目名稱Graph-Theoretic Concepts in Computer Science年度引用學科排名
書目名稱Graph-Theoretic Concepts in Computer Science讀者反饋
書目名稱Graph-Theoretic Concepts in Computer Science讀者反饋學科排名
作者: 線 時間: 2025-3-21 21:38
Approximating minimum weight perfect matchings for complete graphs satisfying the triangle inequalif finding a minimum-weight perfect matching in complete graphs satisfying the triangle inequality. The algorithm is conceptually very simple and has a work measure within a factor of ... of the best exact sequential algorithm. This is the first . approximation algorithm for the problem with a sub-li作者: 征稅 時間: 2025-3-22 04:05
Hierarchically specified unit disk graphs,PACE-hardness results and polynomial time approximations are presented for most of the problems considered. These problems include ...Our PSPACE-hardness results imply the PSPACE-hardness of the geometric location problems in [MS84, WK88], when sets of points are specified hierarchically as in [BOW8作者: 高調(diào) 時間: 2025-3-22 06:53
Bounded tree-width and LOGCFL,ations on .-sourced graphs—on tree-width bounded graphs belong to the complexity class LOGCFL. This is the lowest complexity class known for these problems. Our result complements the research in a series of papers [1, 2, 3, 5, 8, 9, 12, 15, 16] by Arnborg, Bodlaender, Chandrasekharan, Courcelle, He作者: 表被動 時間: 2025-3-22 09:31 作者: Atmosphere 時間: 2025-3-22 16:45
Algorithms and complexity of sandwich problems in graphs (extended abstract),lems generalize recognition problems and arise in various applications. Concentrating mainly on subfamilies of perfect graphs, we give polynomial algorithms for several families and prove the NP-completeness of others.作者: Atmosphere 時間: 2025-3-22 20:07 作者: ASTER 時間: 2025-3-22 21:59 作者: ABIDE 時間: 2025-3-23 03:20 作者: 媽媽不開心 時間: 2025-3-23 08:27
Dynamic algorithms for graphs with treewidth 2,s for graphs with treewidth at most 2 (also called: partial 2-trees, or series-parallel graphs), and for almost trees with parameter .. Each operation can be performed in .(log .) time. For a large number of graph decision, optimization and counting problems, information can be maintained using .(lo作者: 脫落 時間: 2025-3-23 14:18
Efficient algorithms for tripartitioning triconnected graphs and 3-edge-connected graphs, (3)distinct vertices a. ε V′(1 ≤ .) and (4)natural numbers ..(1 ≤ .)(n. ≤ ... ≤ ..) such that .. +... + .. =.′ = |V′|, we compute a partition V.∪...∪V. of . and a partition V′.∪...V′. of . such that (a)each V′. is included in V., (b)each V′. contains the specified vertex a., (c)|V′.| = n. and (d)ea作者: Mangle 時間: 2025-3-23 19:35 作者: 夸張 時間: 2025-3-23 23:44
Graphs, hypergraphs and hashing,ficient and practical algorithms for generating minimal perfect hash functions which allow an arbitrary order to be specified for the keys. We show that almost all members of the family are space and time optimal, and we identify the one with minimum constants. Members of the family generate a minim作者: 勾引 時間: 2025-3-24 02:57
Deciding 3-colourability in less than ,(1.415,) steps,l show that this algorithm tests a graph for 3-Colourability, i.e. an assignment of three colours to the vertices of . such that two adjacent vertices obtain different colours, in less than .(1.415.) steps.作者: FLOUR 時間: 2025-3-24 10:20 作者: arboretum 時間: 2025-3-24 13:49 作者: embolus 時間: 2025-3-24 18:29 作者: 六邊形 時間: 2025-3-24 20:34 作者: cinder 時間: 2025-3-25 01:04 作者: 鬼魂 時間: 2025-3-25 04:25 作者: Bombast 時間: 2025-3-25 11:22 作者: 竊喜 時間: 2025-3-25 14:51 作者: parallelism 時間: 2025-3-25 16:02 作者: prostatitis 時間: 2025-3-25 21:58 作者: 擴張 時間: 2025-3-26 00:24 作者: 行為 時間: 2025-3-26 05:01 作者: MAUVE 時間: 2025-3-26 11:16 作者: 冷漠 時間: 2025-3-26 12:54
https://doi.org/10.1007/978-1-4615-7491-0morphic to . Denote by .. the problem of exsitence of an .-decomposition of a graph. The Holyer‘s problem is to classify the problems P. according to their computational complexities. In this paper we outline the proof of polynomiality of the problem P. for . being the union of . disjoint 2-edge pat作者: FER 時間: 2025-3-26 17:06
Frank L. Margolis,Thomas V. Getchellficient and practical algorithms for generating minimal perfect hash functions which allow an arbitrary order to be specified for the keys. We show that almost all members of the family are space and time optimal, and we identify the one with minimum constants. Members of the family generate a minim作者: Brain-Imaging 時間: 2025-3-26 23:46 作者: Flinch 時間: 2025-3-27 02:42 作者: Common-Migraine 時間: 2025-3-27 08:35
https://doi.org/10.1007/978-3-642-55539-8ordering of their vertex sets. These graphs are all subfamilies of a class of graphs called the asteroidal triple-free graphs. (An independent triple {.} is called an asteroidal triple (AT, for short) if between any pair in the triple there exists a path that avoids the neighbourhood of the third ve作者: Maximizer 時間: 2025-3-27 12:09 作者: Lobotomy 時間: 2025-3-27 16:24 作者: nutrition 時間: 2025-3-27 21:19 作者: 細節(jié) 時間: 2025-3-28 02:00 作者: commodity 時間: 2025-3-28 03:41
Graph-Theoretic Concepts in Computer Science978-3-540-48385-4Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: CODE 時間: 2025-3-28 09:31
Molecular Microbial Ecology ManualThe existence and efficient finding of small dominating sets in dense random graphs is examined in this work. We show, for the model .. with .=1/2, that:.Our results extend to the case G. with . fixed to any constant < 1.作者: Assault 時間: 2025-3-28 10:42
Molecular Neurosurgery with Targeted ToxinsGiven a finite set . of positive integers, with 0 ε ., a .-coloring of a graph . is a function . → IN. such that for each . ? .. The .-span is the difference between the largest and smallest color and the .-span of . is the minimum span over all .-colorings of .. We show that the problem to find the .-span for a complete graph is NP-complete.作者: opprobrious 時間: 2025-3-28 15:01
Near-optimal dominating sets in dense random graphs in polynomial expected time,The existence and efficient finding of small dominating sets in dense random graphs is examined in this work. We show, for the model .. with .=1/2, that:.Our results extend to the case G. with . fixed to any constant < 1.作者: 專心 時間: 2025-3-28 20:33
A rainbow about ,-colorings for complete graphs,Given a finite set . of positive integers, with 0 ε ., a .-coloring of a graph . is a function . → IN. such that for each . ? .. The .-span is the difference between the largest and smallest color and the .-span of . is the minimum span over all .-colorings of .. We show that the problem to find the .-span for a complete graph is NP-complete.作者: Admonish 時間: 2025-3-29 00:03 作者: Assault 時間: 2025-3-29 05:03 作者: Palpable 時間: 2025-3-29 07:32 作者: tenosynovitis 時間: 2025-3-29 15:04
Approximating minimum weight perfect matchings for complete graphs satisfying the triangle inequalinear performance ratio. As was the case in the development of sequential complexity theory, matching problems are on the boundary of what problems might ultimately be described as . for parallel computation. Future work in this area is likely to decide whether these ought to be regarded as those problems in . or those problems in ..作者: troponins 時間: 2025-3-29 16:25 作者: 嫻熟 時間: 2025-3-29 20:55 作者: 軟膏 時間: 2025-3-30 01:22 作者: 褲子 時間: 2025-3-30 06:39
Dynamic algorithms for graphs with treewidth 2, can be performed in .(log .) time. For a large number of graph decision, optimization and counting problems, information can be maintained using .(log .) time per update, such that queries can be resolved in .(log .) or .(1) time. Similar results hold for the classes of almost trees with parameter ., for fixed ..作者: 漸變 時間: 2025-3-30 10:34 作者: heterodox 時間: 2025-3-30 15:53 作者: 包租車船 時間: 2025-3-30 17:59 作者: 松軟無力 時間: 2025-3-30 20:51 作者: 委派 時間: 2025-3-31 01:38 作者: 有罪 時間: 2025-3-31 07:46 作者: 多嘴 時間: 2025-3-31 09:20
https://doi.org/10.1007/978-1-4615-7491-0their computational complexities. In this paper we outline the proof of polynomiality of the problem P. for . being the union of . disjoint 2-edge paths. This case is believed to bear the main difficulties among so far uncovered cases.作者: Permanent 時間: 2025-3-31 13:36 作者: 顛簸下上 時間: 2025-3-31 19:40
Klaus Gundertofte,Flemming Steen J?rgensend time per update in a sequence of . edge insertions, which favourably compares to the trivial . worst case time bound (applying the off-line algorithm). The additional space requirement, besides the space to represent the graph itself, is .. We also discuss by an example the harder . version of topological order.作者: 受人支配 時間: 2025-4-1 00:33 作者: 外來 時間: 2025-4-1 03:02 作者: 鍍金 時間: 2025-4-1 06:08 作者: 寬宏大量 時間: 2025-4-1 12:55 作者: FLAG 時間: 2025-4-1 15:30 作者: CLAY 時間: 2025-4-1 18:40
https://doi.org/10.1007/978-1-349-12973-7tized time per update. These bounds compares favorably with the best bounds known using worst case analysis. Moreover we consider an intermediate model beetween worst case analysis and average case analysis, the semi-random adversary introduced in [2].作者: 一加就噴出 時間: 2025-4-1 23:25
Frank L. Margolis,Thomas V. Getchelleterministically to a minimal perfect hash function. We give strong practical and theoretical evidence that the first step uses linear random time. The second step runs in linear deterministic time. The family not only has theoretical importance, but also offers the fastest known method for generating perfect hash functions.作者: 幻想 時間: 2025-4-2 03:17
