書目名稱Graph-Theoretic Concepts in Computer Science影響因子(影響力)學(xué)科排名
書目名稱Graph-Theoretic Concepts in Computer Science網(wǎng)絡(luò)公開度
書目名稱Graph-Theoretic Concepts in Computer Science網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Graph-Theoretic Concepts in Computer Science被引頻次
書目名稱Graph-Theoretic Concepts in Computer Science被引頻次學(xué)科排名
書目名稱Graph-Theoretic Concepts in Computer Science年度引用
書目名稱Graph-Theoretic Concepts in Computer Science年度引用學(xué)科排名
書目名稱Graph-Theoretic Concepts in Computer Science讀者反饋
書目名稱Graph-Theoretic Concepts in Computer Science讀者反饋學(xué)科排名
作者: HAWK 時間: 2025-3-21 21:31
Proximity-Preserving Labeling Schemes and Their Applications,he label size is replaced by a factor logarithmic in the network’s diameter.) In addition to their theoretical interest, proximity-preserving labeling systems seem to have some relevance in the context of communication networks. We illustrate this by proposing a potential application of our labeling作者: Ostrich 時間: 2025-3-22 01:37
ns of the stencils are restricted, and quality restrictions are replaced with a wide variety of constraints pertaining to patterns on the fabric. Cutting images can be reused in this case, and therefore more runtime is allowed. The most successful algorithmic variant for this case employs a fast ran作者: 重疊 時間: 2025-3-22 05:07 作者: projectile 時間: 2025-3-22 11:12
,Discrete Optimization Methods for Packing Problems in Two and Three Dimensions — With Applications and presents methods for solving such problems. We solve these problems with methods from combinatorial optimization. Our research leads to software that is used in the respective industrial branches..On leather, the problem is to place stencils (for objects such as sofas, car seats, shoes etc.) on 作者: 印第安人 時間: 2025-3-22 16:47 作者: 印第安人 時間: 2025-3-22 20:04 作者: 漂浮 時間: 2025-3-23 00:27 作者: 甜瓜 時間: 2025-3-23 01:33
Lower Bounds for Approximating Shortest Superstrings over an Alphabet of Size 2,sed in that paper produces instances with arbitrarily large alphabets. We show that the problem is APX-hard even if the size of the alphabet is 2..A lot of results concerning approximation algorithms have been published. We use our result to establish the first explicit inapproximability results for作者: 消毒 時間: 2025-3-23 08:54 作者: fatuity 時間: 2025-3-23 10:28
On Minimum Diameter Spanning Trees under Reload Costs,pending on the colors of the pair of edges used by a walk through the node..In this paper we consider the problem of finding a spanning tree of minimum diameter with respect to the underlying reload costs. We present hardness results and lower bounds for the approximability even on graphs with maxim作者: 營養(yǎng) 時間: 2025-3-23 16:42
Induced Matchings in Regular Graphs and Trees,s in a regular graph of degree . can be approximated with a performance ratio less than .. However MIM is NP-hard to approximate within some constant . > 1 even if the input is restricted to various classes of bounded degree and regular graphs. Finally we describe a simple algorithm providing a line作者: 有毛就脫毛 時間: 2025-3-23 22:06
Mod-2 Independence and Domination in Graphs,n number of arcs into the subset. This algorithm allows us to give a combinatorial interpretation of Gauss-Jordan and Gauss elimination on square boolean matrices. In addition to solving this independence-mod-2 (even) set existence problem we also give efficient algorithms for related domination-mod作者: 閑聊 時間: 2025-3-23 22:35
NLC2-Decomposition in Polynomial Time,ertices using the operations in question. The width of the decomposition is the number of labels used, and the NLC-width of the graph is the smallest width among its NLC-decompositions. Many difficult graph problems can be solved efficiently with dynamic programming if an NLC-decomposition of low wi作者: Chauvinistic 時間: 2025-3-24 03:16 作者: sed-rate 時間: 2025-3-24 09:03 作者: LEER 時間: 2025-3-24 14:37 作者: expeditious 時間: 2025-3-24 18:21 作者: finale 時間: 2025-3-24 22:49 作者: 我就不公正 時間: 2025-3-25 01:12
Routing Permutations in the Hypercube,Using the computer, we show that for . . and for any permutation on its vertices, there exists a system of pairwise arc-disjoint directed paths from each vertex to its target in the permutation. This gives the answer to Szymanski’s conjecture [.] for dimension 4. In addition to this study, we consid作者: Acetaminophen 時間: 2025-3-25 05:42 作者: 取回 時間: 2025-3-25 08:15
https://doi.org/10.1007/978-1-349-05006-2se che politologi e futurologi ci hanno prodigato nel tempo. Ogni continuita’ col passato e’ solo apparente, le dinamiche in realta’ sono caotiche, e le divergenze sono radicali. L’informatica, uno degli enzimi di questa trasformazione, si manifesta come ibrido scientifico- filosofico ed agisce come作者: 消息靈通 時間: 2025-3-25 12:47
https://doi.org/10.1007/978-1-349-03509-0 a graph with short labels in such a way that the . between any two vertices can be inferred from inspecting their labels. A labeling scheme enjoying this property is termed a . labeling scheme. It is shown that for the class of .-vertex weighted trees with M-bit edge weights, there exists such a pr作者: 愉快嗎 時間: 2025-3-25 16:35
https://doi.org/10.1007/978-3-319-90899-1een the vertices of a graph and the goal is to find a shortest transportation that serves all the jobs. This problem is known to be .-hard even on trees. We consider the extension when precedence relations between the jobs with the same source are given. Our results include a polynomial time algorit作者: fibroblast 時間: 2025-3-26 00:00
https://doi.org/10.1007/978-94-011-2050-0sed in that paper produces instances with arbitrarily large alphabets. We show that the problem is APX-hard even if the size of the alphabet is 2..A lot of results concerning approximation algorithms have been published. We use our result to establish the first explicit inapproximability results for作者: chapel 時間: 2025-3-26 01:38
https://doi.org/10.1007/978-1-59745-149-9 this paper the NP-hardness of a variety of edge modification problems with respect to some well-studied classes of graphs. These include perfect, chordal, chain, comparability, split and asteroidal triple free. We show that some of these problems become polynomial when the input graph has bounded d作者: 聯(lián)想記憶 時間: 2025-3-26 04:39 作者: Constrain 時間: 2025-3-26 10:04 作者: Certainty 時間: 2025-3-26 14:21
Modern High Temperature Sciencen number of arcs into the subset. This algorithm allows us to give a combinatorial interpretation of Gauss-Jordan and Gauss elimination on square boolean matrices. In addition to solving this independence-mod-2 (even) set existence problem we also give efficient algorithms for related domination-mod作者: 自制 時間: 2025-3-26 17:24 作者: 貞潔 時間: 2025-3-27 00:14
https://doi.org/10.1007/978-1-84800-088-9is on the analysis of such graphs. Based on the paradigm that a graph of a system contains information about the system’s structure, the paper contributes within the following respects: 1. It introduces a new and lucid structure measure, the so-called weighted partial connectivity, ., whose maximiza作者: 含糊 時間: 2025-3-27 03:46
https://doi.org/10.1007/978-981-19-5775-8n graph operations which use . vertex labels. In this paper we study the clique—width of perfect graph classes. On one hand, we show that every distance—hereditary graph, has clique—`width at most 3, and a 3—expression defining it can be obtained in linear time. On the other hand, we show that the c作者: isotope 時間: 2025-3-27 07:59 作者: ENDOW 時間: 2025-3-27 09:32 作者: conscribe 時間: 2025-3-27 15:00 作者: Benzodiazepines 時間: 2025-3-27 21:47
https://doi.org/10.1007/978-0-387-79080-0Using the computer, we show that for . . and for any permutation on its vertices, there exists a system of pairwise arc-disjoint directed paths from each vertex to its target in the permutation. This gives the answer to Szymanski’s conjecture [.] for dimension 4. In addition to this study, we consid作者: Nibble 時間: 2025-3-27 22:10 作者: 破裂 時間: 2025-3-28 03:10 作者: Irascible 時間: 2025-3-28 07:51 作者: 禍害隱伏 時間: 2025-3-28 14:07 作者: 兒童 時間: 2025-3-28 14:57 作者: Palpate 時間: 2025-3-28 19:27
https://doi.org/10.1007/978-3-030-91967-2ime. So far this has been possible only for . = 1, which corresponds to cographs. In this paper, an algorithm is presented that works for . = 2. It runs in .(. . log .) time and uses .(. .) space. Related concepts: clique-decomposition, cliquewidth.作者: 極小量 時間: 2025-3-29 02:19 作者: Armada 時間: 2025-3-29 04:17
,Informatica, Scuola, Communità: Uno Sguardo dall’ Occhio del Ciclone,iale, il momento di fissione delle regole attive della nuova societa’. Al tempo stesso, il sostrato su cui queste trasformazioni sono costrette ad operare e’ la comunita’..Uno sguardo, dal centro della trasformazione, a queste tre componenti e la loro interazione.作者: septicemia 時間: 2025-3-29 07:48 作者: dry-eye 時間: 2025-3-29 13:24 作者: resuscitation 時間: 2025-3-29 19:14 作者: agnostic 時間: 2025-3-29 23:37
On Minimum Diameter Spanning Trees under Reload Costs,m diameter with respect to the underlying reload costs. We present hardness results and lower bounds for the approximability even on graphs with maximum degree 5. On the other hand we provide an exact algorithm for graphs of maximum degree 3.作者: GAVEL 時間: 2025-3-30 00:34 作者: 發(fā)怨言 時間: 2025-3-30 07:14 作者: reception 時間: 2025-3-30 11:31 作者: TERRA 時間: 2025-3-30 14:27 作者: AGGER 時間: 2025-3-30 17:37
https://doi.org/10.1007/978-1-4613-0103-5. such that the broadcasting time remains n if at most . faults are allowed in any step. We prove that k equals either .-2 or .-3. Our method is related to the isoperimetric problem in graphs and can be applied to other networks.作者: 后來 時間: 2025-3-30 23:15
On the Nature of Structure and Its Identification, minimum cut splitting measure. A key concept of the proposed structure definition is its implicit determination of an optimum number of clusters..Different applications, which illustrate the usability of the measure and the algorithm, round off the paper (Section 5).作者: Efflorescent 時間: 2025-3-31 02:37 作者: dainty 時間: 2025-3-31 07:20 作者: Peculate 時間: 2025-3-31 13:10 作者: magnate 時間: 2025-3-31 13:23
Modern High Temperature Science-2 (odd) set existence problems on digraphs. However, for each of the four combinations of these two properties we show that even though the existence problem on digraphs is tractable, the problems of deciding the existence of a set of size exactly ., larger than ., or smaller than ., for a given ., are all NP-complete for undirected graphs.作者: 啞巴 時間: 2025-3-31 17:48 作者: 無動于衷 時間: 2025-4-1 01:33
Mod-2 Independence and Domination in Graphs,-2 (odd) set existence problems on digraphs. However, for each of the four combinations of these two properties we show that even though the existence problem on digraphs is tractable, the problems of deciding the existence of a set of size exactly ., larger than ., or smaller than ., for a given ., are all NP-complete for undirected graphs.作者: ONYM 時間: 2025-4-1 02:20
Graph-Theoretic Concepts in Computer Science978-3-540-46784-7Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: arcane 時間: 2025-4-1 08:40
https://doi.org/10.1007/978-3-211-75123-7The following text is a written version of the dinner speech, which was given by the author at the occasion of the 25th Workshop on Graphtheoretic Concepts in Computer Science (WG ’99), Ascona, June 18, 1999.作者: 連鎖 時間: 2025-4-1 12:08
https://doi.org/10.1007/978-4-431-68207-3In this paper we survey results on the design and analysis of online algorithms, focusing on problems where graphs and graphtheoretic concepts have proven particularly useful in the formulation or in the solution of the problem. For each of the problems addressed, we also present important open questions.作者: follicle 時間: 2025-4-1 17:25 作者: FATAL 時間: 2025-4-1 20:22
