書目名稱Graph Theory, Computational Intelligence and Thought影響因子(影響力)學(xué)科排名
書目名稱Graph Theory, Computational Intelligence and Thought網(wǎng)絡(luò)公開度
書目名稱Graph Theory, Computational Intelligence and Thought網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Graph Theory, Computational Intelligence and Thought被引頻次
書目名稱Graph Theory, Computational Intelligence and Thought被引頻次學(xué)科排名
書目名稱Graph Theory, Computational Intelligence and Thought年度引用
書目名稱Graph Theory, Computational Intelligence and Thought年度引用學(xué)科排名
書目名稱Graph Theory, Computational Intelligence and Thought讀者反饋
書目名稱Graph Theory, Computational Intelligence and Thought讀者反饋學(xué)科排名
作者: 槍支 時(shí)間: 2025-3-21 22:28 作者: 攀登 時(shí)間: 2025-3-22 01:44
https://doi.org/10.1007/978-3-322-87090-2s a result, we select dominating local search heuristics. One of the most interesting conclusions is that combination of two heuristics may yield a superior heuristic with respect to both solution quality and the running time.作者: 勉強(qiáng) 時(shí)間: 2025-3-22 04:32 作者: 殘酷的地方 時(shí)間: 2025-3-22 09:37
Asynchronous Congestion Games,d by the earliest time his task is completed, and thus it might be beneficial for him to assign his task to several resources. We show the existence of pure strategy Nash equilibria in ACGs. Moreover, we present a polynomial time algorithm for finding such an equilibrium in a given ACG.作者: 臭名昭著 時(shí)間: 2025-3-22 13:36 作者: 臭名昭著 時(shí)間: 2025-3-22 19:07 作者: Estrogen 時(shí)間: 2025-3-22 23:00
Path Partitions, Cycle Covers and Integer Decomposition,Kleitman’s well-known theorem on posets to arbitrary digraphs which implies recent and classical purely graph theoretical results on cycle covers, is closely related to conjectures of Berge and Linial on path partitions, and implies these for some particular values of the parameters.作者: Banister 時(shí)間: 2025-3-23 01:38 作者: 其他 時(shí)間: 2025-3-23 09:00 作者: 排斥 時(shí)間: 2025-3-23 10:06
Properly Coloured Cycles and Paths: Results and Open Problems,h that allow us to check the existence of PC cycles and PC (.,.)-paths in . and, if they exist, to find shortest ones among them. We raise a problem of finding the optimal transformation and consider a possible solution to the problem.作者: BLINK 時(shí)間: 2025-3-23 14:44
https://doi.org/10.1007/978-3-662-69201-1proved that any .?∈?Ψ(.) is a subset of a maximum stable set of .,[19]..In this paper we demonstrate that if .?∈?Ψ(.), the subgraph . induced by .?∪?.(.) is a K?nig-Egerváry graph, and . is a maximum matching in ., then . is a local maximum stable set in the line graph of ..作者: ALE 時(shí)間: 2025-3-23 20:39 作者: 牢騷 時(shí)間: 2025-3-24 01:44
https://doi.org/10.1007/978-3-658-40421-5h that allow us to check the existence of PC cycles and PC (.,.)-paths in . and, if they exist, to find shortest ones among them. We raise a problem of finding the optimal transformation and consider a possible solution to the problem.作者: 松軟 時(shí)間: 2025-3-24 06:03
Mit Controlling zum Projekterfolgresource executes its assigned tasks in a random order. Each player’s aim is to minimize his expected cost which is the sum of two terms – the sum of the fixed costs over the set of his utilized resources and the expected cost of his task execution. The cost of a player’s task execution is determine作者: TOXIN 時(shí)間: 2025-3-24 07:06
https://doi.org/10.1007/978-3-662-68494-8n clauses from the family without having resolvents of a certain kind? We consider various problems of this type, and give some sharp bounds. We also consider the probability that a random family of a given size implies all other clauses in the family, and we prove the existence of a sharp threshold作者: BOAST 時(shí)間: 2025-3-24 12:40
https://doi.org/10.1007/978-3-662-65646-4s of ., such that every vertex of . is covered exactly once. The.: cover the edges of . by a minimum number of copies of trees of ., such that every edge of . is covered exactly once. For a solution to always exist, we assume that . contains a one vertex (one edge) tree..Two versions of Problem FVC 作者: Annotate 時(shí)間: 2025-3-24 18:04 作者: Toxoid-Vaccines 時(shí)間: 2025-3-24 21:28 作者: Allodynia 時(shí)間: 2025-3-24 23:22 作者: 是剝皮 時(shí)間: 2025-3-25 05:29
https://doi.org/10.1007/978-3-658-15658-9 For .?=?1, this gives the usual notion of matching in graphs, and for general .?≥?1, distance-. matchings were called . by Stockmeyer and Vazirani. The special case .?=?2 has been studied under the names . (i.e., a matching which forms an induced subgraph in .) by Cameron and . by Golumbic and Lask作者: Duodenitis 時(shí)間: 2025-3-25 10:46
https://doi.org/10.1007/978-3-662-69201-1write .?∈?Ψ(.), if . is a maximum stable set of the subgraph induced by .?∪?.(.), where .(.) is the neighborhood of .,[11]. Nemhauser and Trotter Jr. proved that any .?∈?Ψ(.) is a subset of a maximum stable set of .,[19]..In this paper we demonstrate that if .?∈?Ψ(.), the subgraph . induced by .?∪?.作者: 遺留之物 時(shí)間: 2025-3-25 14:01 作者: 弄皺 時(shí)間: 2025-3-25 19:05
https://doi.org/10.1007/978-3-658-01900-6status of the problem is not known if the input is restricted to graphs with no cycles of length 4. We conjecture that the problem is polynomial if the input graph does not contain cycles of length 4 and 6, and prove several theorems supporting our conjecture.作者: 受人支配 時(shí)間: 2025-3-25 22:05 作者: Altitude 時(shí)間: 2025-3-26 02:25 作者: BRIDE 時(shí)間: 2025-3-26 05:27 作者: 洞穴 時(shí)間: 2025-3-26 10:51
https://doi.org/10.1007/978-3-658-40421-5w some known results and prove new ones. In particular, we consider a family of transformations of an edge-coloured multigraph . into an ordinary graph that allow us to check the existence of PC cycles and PC (.,.)-paths in . and, if they exist, to find shortest ones among them. We raise a problem o作者: arterioles 時(shí)間: 2025-3-26 14:44 作者: 有說服力 時(shí)間: 2025-3-26 18:28 作者: 粘連 時(shí)間: 2025-3-27 00:46
Covering a Tree by a Forest,s of ., such that every vertex of . is covered exactly once. The.: cover the edges of . by a minimum number of copies of trees of ., such that every edge of . is covered exactly once. For a solution to always exist, we assume that . contains a one vertex (one edge) tree..Two versions of Problem FVC 作者: 和藹 時(shí)間: 2025-3-27 03:00 作者: 符合規(guī)定 時(shí)間: 2025-3-27 08:45 作者: 輕打 時(shí)間: 2025-3-27 10:06
Local Search Heuristics for the Multidimensional Assignment Problem, most studied case of MAP is 3-AP, though the problems with larger values of . have also a number of applications. We consider several known and new MAP local search heuristics for MAP as well as their combinations. Computational experiments with three instance families are provided and discussed. A作者: lactic 時(shí)間: 2025-3-27 14:04 作者: 有惡意 時(shí)間: 2025-3-27 21:17 作者: G-spot 時(shí)間: 2025-3-28 02:01 作者: Costume 時(shí)間: 2025-3-28 04:18
On Related Edges in Well-Covered Graphs without Cycles of Length 4 and 6,status of the problem is not known if the input is restricted to graphs with no cycles of length 4. We conjecture that the problem is polynomial if the input graph does not contain cycles of length 4 and 6, and prove several theorems supporting our conjecture.作者: 事先無準(zhǔn)備 時(shí)間: 2025-3-28 09:38 作者: 偏狂癥 時(shí)間: 2025-3-28 13:27
Path-Bicolorable Graphs,if its vertex set . can be partitioned into two subsets (i.e., colors) .. and .. such that for every induced .. (i.e., path with exactly .???1 edges and . vertices) in ., the two colors alternate along the .., i.e., no two consecutive vertices of the .. belong to the same color .., .?=?1,2. Obviousl作者: Multiple 時(shí)間: 2025-3-28 18:34
Path Partitions, Cycle Covers and Integer Decomposition,otally unimodular constraint matrices have the integer decomposition property, in order to deduce the same property for coflow polyhedra defined by Cameron and Edmonds. We then apply this result to the convex hull of particular stable sets in graphs. Therebye we prove a generalization of Greene and 作者: Inculcate 時(shí)間: 2025-3-28 22:08 作者: paleolithic 時(shí)間: 2025-3-28 23:38 作者: 否認(rèn) 時(shí)間: 2025-3-29 05:46 作者: 背叛者 時(shí)間: 2025-3-29 09:22
https://doi.org/10.1007/978-3-658-01900-6status of the problem is not known if the input is restricted to graphs with no cycles of length 4. We conjecture that the problem is polynomial if the input graph does not contain cycles of length 4 and 6, and prove several theorems supporting our conjecture.作者: Highbrow 時(shí)間: 2025-3-29 11:38 作者: Endemic 時(shí)間: 2025-3-29 17:06 作者: Foreknowledge 時(shí)間: 2025-3-29 22:00
On Related Edges in Well-Covered Graphs without Cycles of Length 4 and 6,status of the problem is not known if the input is restricted to graphs with no cycles of length 4. We conjecture that the problem is polynomial if the input graph does not contain cycles of length 4 and 6, and prove several theorems supporting our conjecture.作者: 關(guān)心 時(shí)間: 2025-3-30 01:38 作者: comely 時(shí)間: 2025-3-30 05:41 作者: 殘忍 時(shí)間: 2025-3-30 08:22
Mit CIM in die Fabrik der Zukunft?We describe polynomial time algorithms to find in subtree filament graphs a minimum dominating hole, a clique intersecting all its maximum independent sets and a maximum induced split subgraph.作者: Frequency-Range 時(shí)間: 2025-3-30 15:01
Mit Controlling zum ProjekterfolgWe consider a two-terminal directed acyclic graph (.) characterized by a special structure of its mincuts and call it a .. This graph is of interest as an st-dag with a minimum possible number of mincuts.We present a linear-time algorithm for recognizing nested graphs.作者: 無政府主義者 時(shí)間: 2025-3-30 19:25 作者: Bouquet 時(shí)間: 2025-3-30 21:32
Landmarks in Algorithmic Graph Theory: A Personal Retrospective,This is an edited version of the conference lecture delivered by the author in celebration of his 60th birthday. It is intended to be an autobiographical tour through stories, pictures and theorems, suitable for both mathematicians and non-scientists.作者: legacy 時(shí)間: 2025-3-31 03:10 作者: accordance 時(shí)間: 2025-3-31 05:47 作者: 妨礙 時(shí)間: 2025-3-31 11:30
A Note on the Recognition of Nested Graphs,We consider a two-terminal directed acyclic graph (.) characterized by a special structure of its mincuts and call it a .. This graph is of interest as an st-dag with a minimum possible number of mincuts.We present a linear-time algorithm for recognizing nested graphs.作者: cinder 時(shí)間: 2025-3-31 17:17
,(, log,) Split Decomposition of Strongly Connected Graphs,In the early 1980’s, Cunningham described a unique decomposition of a strongly-connected graph. A linear time bound for finding it in the special case of an undirected graph has been given previously, but up until now, the best bound known for the general case has been .(..). We give an .(. log.) bound.作者: grotto 時(shí)間: 2025-3-31 19:01
Graph Theory, Computational Intelligence and Thought978-3-642-02029-2Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: kidney 時(shí)間: 2025-4-1 01:15
Alexander Honold,Klaus R. Scherpen of .. It turns out that, in the basic formulation, the approach is hardly suited for practical applications mainly because of its bad scaling in the size of the constraint database. Motivated by these news and based on a variant of hyperconsistency width, a different and more efficient method to d作者: 神圣在玷污 時(shí)間: 2025-4-1 02:57 作者: 要素 時(shí)間: 2025-4-1 06:50
https://doi.org/10.1007/978-3-8349-4260-9 an .(.·.) algorithm to compute the cube representation of a general graph . in .?+?1 dimensions given a bandwidth ordering of the vertices of ., where . is the . of .. As a consequence, we get .(Δ) upper bounds on the cubicity of many well-known graph classes such as AT-free graphs, circular-arc gr
