書目名稱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é)科排名
作者: 馬具 時(shí)間: 2025-3-21 23:19
https://doi.org/10.1007/978-3-662-28402-5cutively in a walk in the graph. In this paper, we look for the smallest set of transitions needed to be able to go from any vertex of the given graph to any other. We prove that this problem is NP-hard and study approximation algorithms. We develop theoretical tools that help to study this problem.作者: JAMB 時(shí)間: 2025-3-22 02:05
Moderne Chirurgie des Rektumkarzinomsoblem cannot be solved in time . on general directed graphs, where . is the treewidth of the underlying undirected graph. This is matched by a dynamic programming algorithm with running time .. On the other hand, we show that if the input digraph is planar, then the running time can be improved to ..作者: hemophilia 時(shí)間: 2025-3-22 06:15
https://doi.org/10.1007/978-3-531-91829-7s note, we show that there are planar graphs of pathwidth 3 with arbitrarily large anagram-free chromatic number. More specifically, we describe 2.-vertex planar graphs of pathwidth 3 with anagram-free chromatic number .. We also describe . vertex graphs with pathwidth . having anagram-free chromatic number in ..作者: 蹣跚 時(shí)間: 2025-3-22 10:46
On Minimum Connecting Transition Sets in Graphs,cutively in a walk in the graph. In this paper, we look for the smallest set of transitions needed to be able to go from any vertex of the given graph to any other. We prove that this problem is NP-hard and study approximation algorithms. We develop theoretical tools that help to study this problem.作者: 蕨類 時(shí)間: 2025-3-22 13:24 作者: 蕨類 時(shí)間: 2025-3-22 19:20 作者: 青少年 時(shí)間: 2025-3-23 00:53
On Dispersable Book Embeddings,such that: (i) no two edges of the same page cross, and (ii) no two edges of the same page share a common endvertex. The minimum number of pages needed in a dispersable book embedding of . is called its ., .(.). Graph . is called . if . equals the maximum degree of ., . (note that . always holds)..B作者: 不規(guī)則 時(shí)間: 2025-3-23 01:40 作者: Ptosis 時(shí)間: 2025-3-23 06:40 作者: Precursor 時(shí)間: 2025-3-23 13:30
On Minimum Connecting Transition Sets in Graphs,cutively in a walk in the graph. In this paper, we look for the smallest set of transitions needed to be able to go from any vertex of the given graph to any other. We prove that this problem is NP-hard and study approximation algorithms. We develop theoretical tools that help to study this problem.作者: 一瞥 時(shí)間: 2025-3-23 14:26
Recognizing Hyperelliptic Graphs in Polynomial Time,aph algorithms and number theory. We consider so-called . (multigraphs of gonality 2) and provide a safe and complete set of reduction rules for such multigraphs, showing that we can recognize hyperelliptic graphs in time ., where . is the number of vertices and . the number of edges of the multigra作者: 艱苦地移動(dòng) 時(shí)間: 2025-3-23 20:51 作者: 刺穿 時(shí)間: 2025-3-24 01:27
,Optimality Program in Segment and?String Graphs,is very likely to be asymptotically best on general graphs. Intrigued by an algorithm packing curves in . by Fox and Pach [SODA’11], we investigate which problems have subexponential algorithms on the intersection graphs of curves (string graphs) or segments (segment intersection graphs) and which p作者: monochromatic 時(shí)間: 2025-3-24 05:15
Anagram-Free Chromatic Number Is Not Pathwidth-Bounded,s note, we show that there are planar graphs of pathwidth 3 with arbitrarily large anagram-free chromatic number. More specifically, we describe 2.-vertex planar graphs of pathwidth 3 with anagram-free chromatic number .. We also describe . vertex graphs with pathwidth . having anagram-free chromati作者: 發(fā)展 時(shí)間: 2025-3-24 08:34 作者: VICT 時(shí)間: 2025-3-24 14:05 作者: Calculus 時(shí)間: 2025-3-24 15:06 作者: 牲畜欄 時(shí)間: 2025-3-24 22:57 作者: cogent 時(shí)間: 2025-3-25 00:43 作者: 嚴(yán)厲譴責(zé) 時(shí)間: 2025-3-25 06:38 作者: detach 時(shí)間: 2025-3-25 09:04
Optimal General Matchings,. such that . for each vertex ., where . denotes the number of edges of . incident to .. The general matching problem asks the existence of a .-matching in a given graph. A set .(.) is said to have a . . if there exists a number . such that . and .. Without any restrictions the general matching prob作者: 茁壯成長 時(shí)間: 2025-3-25 15:34 作者: Pericarditis 時(shí)間: 2025-3-25 15:55 作者: 門閂 時(shí)間: 2025-3-25 22:55 作者: 乳汁 時(shí)間: 2025-3-26 00:30
Covering a Graph with Nontrivial Vertex-Disjoint Paths: Existence and Optimization, the ., one wishes to find a path cover of minimum cardinality. In this problem, known to be .-hard, the set . may contain trivial (single-vertex) paths. We study the problem of finding a path cover composed only of nontrivial paths. First, we show that the corresponding existence problem can be red作者: Canvas 時(shí)間: 2025-3-26 06:58
https://doi.org/10.1007/978-3-662-66655-5such that: (i) no two edges of the same page cross, and (ii) no two edges of the same page share a common endvertex. The minimum number of pages needed in a dispersable book embedding of . is called its ., .(.). Graph . is called . if . equals the maximum degree of ., . (note that . always holds)..B作者: 執(zhí) 時(shí)間: 2025-3-26 12:28
Moderne Baukonstruktion: Fassadensult from Corneil and Stacho, these graphs were characterised through a linear vertex ordering called an AT-free order. Here, we use techniques from abstract convex geometry to improve on this result by giving a vertex order characterisation with stronger structural properties and thus resolve an op作者: 起波瀾 時(shí)間: 2025-3-26 14:01 作者: Dignant 時(shí)間: 2025-3-26 16:59
https://doi.org/10.1007/978-3-662-28402-5cutively in a walk in the graph. In this paper, we look for the smallest set of transitions needed to be able to go from any vertex of the given graph to any other. We prove that this problem is NP-hard and study approximation algorithms. We develop theoretical tools that help to study this problem.作者: crucial 時(shí)間: 2025-3-26 20:58
https://doi.org/10.1007/978-3-662-53188-4aph algorithms and number theory. We consider so-called . (multigraphs of gonality 2) and provide a safe and complete set of reduction rules for such multigraphs, showing that we can recognize hyperelliptic graphs in time ., where . is the number of vertices and . the number of edges of the multigra作者: mortuary 時(shí)間: 2025-3-27 02:12
Moderne Chirurgie des Rektumkarzinomsoblem cannot be solved in time . on general directed graphs, where . is the treewidth of the underlying undirected graph. This is matched by a dynamic programming algorithm with running time .. On the other hand, we show that if the input digraph is planar, then the running time can be improved to .作者: Agronomy 時(shí)間: 2025-3-27 05:43 作者: Alcove 時(shí)間: 2025-3-27 09:40
https://doi.org/10.1007/978-3-531-91829-7s note, we show that there are planar graphs of pathwidth 3 with arbitrarily large anagram-free chromatic number. More specifically, we describe 2.-vertex planar graphs of pathwidth 3 with anagram-free chromatic number .. We also describe . vertex graphs with pathwidth . having anagram-free chromati作者: amorphous 時(shí)間: 2025-3-27 16:13 作者: 我不死扛 時(shí)間: 2025-3-27 21:19 作者: 溝通 時(shí)間: 2025-3-27 22:48
Moderne Entwicklungen auf dem Gestagengebiety an important role in the study of rank-width. However, so far, pivot-minors have only been studied from a structural perspective. We initiate a systematic study into their complexity aspects. We first prove that the . problem, which asks if a given graph?. contains a given graph?. as a pivot-minor作者: 閃光東本 時(shí)間: 2025-3-28 02:19
https://doi.org/10.1007/978-3-642-99486-9e stored string without reading all bits. This is the one-element version of the problem of membership testing in the bit probe model, and solutions can serve as building blocks of general membership testers. Our principal contribution is the equivalence of saving probe bits with some generalized no作者: 轉(zhuǎn)向 時(shí)間: 2025-3-28 07:19
https://doi.org/10.1007/978-3-642-47535-1are given connected graphs . and the goal is to determine whether . is an .-amalgamation of . and .. Our main result states that . can be solved in time . where . are the number of vertices, the treewidth and the maximum degree of . respectively..We generalize the techniques used in our algorithm fo作者: 異教徒 時(shí)間: 2025-3-28 13:49 作者: 獨(dú)輪車 時(shí)間: 2025-3-28 17:43
Moderne Geriatrie und Akutmedizin. such that . for each vertex ., where . denotes the number of edges of . incident to .. The general matching problem asks the existence of a .-matching in a given graph. A set .(.) is said to have a . . if there exists a number . such that . and .. Without any restrictions the general matching prob作者: AUGUR 時(shí)間: 2025-3-28 20:14 作者: TEN 時(shí)間: 2025-3-29 01:14
Moderne Identit?t und Gesellschaftry by Thurston lead to effective versions of the Riemann Mapping Theorem and motivated Schramm’s Monster Packing Theorem. Monster Packing implies the existence of contact representations of planar triangulations where each vertex?. is represented by a homothetic copy of some smooth strictly-convex p作者: Glaci冰 時(shí)間: 2025-3-29 05:50
Helmut A. Stickl,Christian Kunzhe vertex set is fixed but the edges have (discrete) time labels. Since the corresponding . (.,?.). problem is .-hard, it is natural to investigate whether relevant special cases exist that are computationally tractable. To this end, we study restrictions of the underlying (static) graph—there we ob作者: ERUPT 時(shí)間: 2025-3-29 07:31 作者: ALERT 時(shí)間: 2025-3-29 13:48 作者: 鎮(zhèn)痛劑 時(shí)間: 2025-3-29 15:38
Saving Probe Bits by Cube Domination, low-dimensional (grid) relaxations of the problem. The design of optimal schemes remains an open problem, however one has to notice that even usual domination in hypercubes is far from being completely understood.作者: Jargon 時(shí)間: 2025-3-29 21:32 作者: 匍匐 時(shí)間: 2025-3-30 02:59
Equiangular Polygon Contact Representations,linear equations whose variables correspond to lengths of boundary segments of the .-gons. If the system has a non-negative solution, this yields the intended contact representation. If the solution of the system contains negative variables, these can be used as sign-posts indicating how to change t作者: 亞麻制品 時(shí)間: 2025-3-30 05:32 作者: arrhythmic 時(shí)間: 2025-3-30 11:46
https://doi.org/10.1007/3-211-37838-3 a graph with no separating triangles. (iv) We exhibit an infinite family of simple optimal 2-plane graphs such that in any edge partition composed of a 1-plane graph and a plane graph, the plane graph has maximum vertex degree at least 6. (v) We show that every optimal 3-plane graph whose crossing-作者: 根除 時(shí)間: 2025-3-30 14:36 作者: 點(diǎn)燃 時(shí)間: 2025-3-30 20:00 作者: 吹牛大王 時(shí)間: 2025-3-30 23:40
Moderne Identit?t und Gesellschaftlinear equations whose variables correspond to lengths of boundary segments of the .-gons. If the system has a non-negative solution, this yields the intended contact representation. If the solution of the system contains negative variables, these can be used as sign-posts indicating how to change t作者: Minuet 時(shí)間: 2025-3-31 01:51
https://doi.org/10.1007/978-3-663-15866-0 polynomial time. For the minimization problem on feasible instances, we show that its computational complexity is equivalent to the minimum path cover problem. We also show a linear-time algorithm on (edge-weighted) trees.作者: mighty 時(shí)間: 2025-3-31 05:17 作者: multiply 時(shí)間: 2025-3-31 09:30 作者: 制造 時(shí)間: 2025-3-31 15:59 作者: GULP 時(shí)間: 2025-3-31 21:13 作者: Eviction 時(shí)間: 2025-3-31 21:40
