標(biāo)題: Titlebook: ; [打印本頁] 作者: Exacting 時間: 2025-3-21 18:04
書目名稱Graphs and Combinatorial Optimization: from Theory to Applications影響因子(影響力)
書目名稱Graphs and Combinatorial Optimization: from Theory to Applications影響因子(影響力)學(xué)科排名
書目名稱Graphs and Combinatorial Optimization: from Theory to Applications網(wǎng)絡(luò)公開度
書目名稱Graphs and Combinatorial Optimization: from Theory to Applications網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Graphs and Combinatorial Optimization: from Theory to Applications被引頻次
書目名稱Graphs and Combinatorial Optimization: from Theory to Applications被引頻次學(xué)科排名
書目名稱Graphs and Combinatorial Optimization: from Theory to Applications年度引用
書目名稱Graphs and Combinatorial Optimization: from Theory to Applications年度引用學(xué)科排名
書目名稱Graphs and Combinatorial Optimization: from Theory to Applications讀者反饋
書目名稱Graphs and Combinatorial Optimization: from Theory to Applications讀者反饋學(xué)科排名
作者: Fallibility 時間: 2025-3-21 23:57
https://doi.org/10.1007/978-3-0348-5562-4The distance geometry problem consists in finding a realization of a weighted graph in a Euclidean space of given dimension, where the edges are realized as straight segments of length equal to the edge weight. We propose and test a new mathematical programming formulation based on the incidence between cycles and edges in the given graph.作者: lactic 時間: 2025-3-22 02:01 作者: 聾子 時間: 2025-3-22 06:31 作者: COW 時間: 2025-3-22 12:24
https://doi.org/10.1007/978-3-663-02711-9 instigate the polyhedral investigation of the convex hull of fixed cardinality stable sets, and we begin by introducing a large class of valid inequalities to the natural integer programming formulation of the problem.作者: Collision 時間: 2025-3-22 15:38 作者: Collision 時間: 2025-3-22 20:53 作者: single 時間: 2025-3-23 00:02
The Unsuitable Neighbourhood Inequalities for the Fixed Cardinality Stable Set Polytope, instigate the polyhedral investigation of the convex hull of fixed cardinality stable sets, and we begin by introducing a large class of valid inequalities to the natural integer programming formulation of the problem.作者: 事與愿違 時間: 2025-3-23 03:46 作者: 泄露 時間: 2025-3-23 09:10 作者: 硬化 時間: 2025-3-23 11:48 作者: SYN 時間: 2025-3-23 17:37
Graphs and Combinatorial Optimization: from Theory to Applications作者: flutter 時間: 2025-3-23 18:36
The Chromatic Polynomial of a Digraph,ber of such colorings with . colors can be done by counting so-called Neumann-Lara-coflows (NL-coflows), which build a polynomial in .. We will present a representation of this polynomial using totally cyclic subdigraphs, which form a graded poset .. Furthermore we will decompose our NL-coflow polyn作者: BOOST 時間: 2025-3-24 01:02
On List ,-Coloring Convex Bipartite Graphs,with colors in {1, 2, …, .}. The problem is known to be NP-hard even for .?=?3 within the class of 3-regular planar bipartite graphs and for .?=?4 within the class of chordal bipartite graphs. In 2015 Huang, Johnson and Paulusma asked for the complexity of . 3. in the class of chordal bipartite grap作者: syncope 時間: 2025-3-24 03:09
Total Chromatic Sum for Trees, provide infinite families of trees for which the minimum number of colors to achieve the total chromatic sum is equal to the total chromatic number. We construct infinite families of trees for which these numbers are not equal, disproving the conjecture from 2012.作者: 間諜活動 時間: 2025-3-24 08:32 作者: Myosin 時間: 2025-3-24 12:32 作者: 百靈鳥 時間: 2025-3-24 15:27 作者: 千篇一律 時間: 2025-3-24 22:49 作者: 極小 時間: 2025-3-24 23:49 作者: intellect 時間: 2025-3-25 07:14 作者: Pcos971 時間: 2025-3-25 07:37 作者: 獸皮 時間: 2025-3-25 13:30 作者: 草率男 時間: 2025-3-25 16:11
An Approximation Algorithm for Network Flow Interdiction with Unit Costs and Two Capacities,and capacities such that the value of a maximum flow from a source . to a sink . is minimized. Although the problem has high applicability in real world problems and is known to be strongly .-hard, only few polynomial-time approximation algorithms are known. In this paper, we present a (.?+?1)-appro作者: 調(diào)整 時間: 2025-3-25 22:58 作者: 樂意 時間: 2025-3-26 03:56 作者: 亞當(dāng)心理陰影 時間: 2025-3-26 04:27 作者: 向宇宙 時間: 2025-3-26 08:44 作者: endure 時間: 2025-3-26 14:53 作者: scotoma 時間: 2025-3-26 19:09 作者: 圍裙 時間: 2025-3-26 21:50
Günther Bernatzky,Gunter Kreutzber of such colorings with . colors can be done by counting so-called Neumann-Lara-coflows (NL-coflows), which build a polynomial in .. We will present a representation of this polynomial using totally cyclic subdigraphs, which form a graded poset .. Furthermore we will decompose our NL-coflow polyn作者: 責(zé)任 時間: 2025-3-27 01:55
Günther Bernatzky,Gunter Kreutzwith colors in {1, 2, …, .}. The problem is known to be NP-hard even for .?=?3 within the class of 3-regular planar bipartite graphs and for .?=?4 within the class of chordal bipartite graphs. In 2015 Huang, Johnson and Paulusma asked for the complexity of . 3. in the class of chordal bipartite grap作者: DRILL 時間: 2025-3-27 09:10
https://doi.org/10.1007/978-3-0348-5824-3 provide infinite families of trees for which the minimum number of colors to achieve the total chromatic sum is equal to the total chromatic number. We construct infinite families of trees for which these numbers are not equal, disproving the conjecture from 2012.作者: CLAM 時間: 2025-3-27 13:29
https://doi.org/10.1007/978-3-531-19652-7 coloring is the most naturally used one. In greedy coloring, vertices are traversed following an order and hence performance of it highly depends on finding a good order. In this paper, we propose an . (ISH) which considers some .. random orders and for each of them it calls a . (SS) procedure with作者: GEST 時間: 2025-3-27 14:31 作者: 過度 時間: 2025-3-27 20:23 作者: 隱藏 時間: 2025-3-27 23:02
https://doi.org/10.1007/978-3-662-66797-2 an interval coloring problem in the edge intersection graph of these paths. The interval chromatic number equals the smallest size of a spectrum such that a proper interval coloring is possible, the weighted clique number is a natural lower bound. Graphs where both parameters coincide for all possi作者: 有害處 時間: 2025-3-28 05:05
https://doi.org/10.1007/978-3-663-02711-9 instigate the polyhedral investigation of the convex hull of fixed cardinality stable sets, and we begin by introducing a large class of valid inequalities to the natural integer programming formulation of the problem.作者: 過于光澤 時間: 2025-3-28 09:11
https://doi.org/10.1007/978-3-476-03728-2e been broadly studied and extended to hypergraphs classes. A generalized power graph . of a graph . is a .-uniform hypergraph constructed by blowing up each vertex of . into a .-set of vertices and then adding .???2. vertices of degree one to each edge, where .?≥?2.. A natural question is whether t作者: 現(xiàn)任者 時間: 2025-3-28 10:55
https://doi.org/10.1007/978-3-476-03612-4reserving continuous motions of the joints arise from isometries. A rigid framework is isostatic if deleting any single edge results in a flexible framework. Generically, rigidity depends only on the graph and we say an Assur graph is a pinned isostatic graph with no proper pinned isostatic subgraph作者: LOPE 時間: 2025-3-28 14:55
https://doi.org/10.1007/978-3-7091-2302-7red upper bound on the necessary number of time steps until all vertices are reached is proven for some specific graph classes, it remains open for trees in general. We present two different proofs for ordinary caterpillars and prove the conjecture for a generalised version of caterpillars and for t作者: 卵石 時間: 2025-3-28 19:21
https://doi.org/10.1007/978-3-663-02712-6and capacities such that the value of a maximum flow from a source . to a sink . is minimized. Although the problem has high applicability in real world problems and is known to be strongly .-hard, only few polynomial-time approximation algorithms are known. In this paper, we present a (.?+?1)-appro作者: PAGAN 時間: 2025-3-29 02:41 作者: 核心 時間: 2025-3-29 06:29
"Musikalisches Ideen-Instrument"athematicians have also found them to be an interesting topic of study. We define and introduce Zagreb indices for directed graphs, give results that parallel many of the conjectures and theorems that exist for the original Zagreb indices, and produce results specific to the directed graph case.作者: enterprise 時間: 2025-3-29 11:05 作者: Painstaking 時間: 2025-3-29 13:49 作者: 萬靈丹 時間: 2025-3-29 16:08
https://doi.org/10.1007/978-3-658-29243-0hicle Routing Problem (TWAVRP). The TWAVRP appears when the volume of customer demands is uncertain and time windows should be allocated to customers so as to minimize expected travel costs. Our goal is to find a heuristic strategy that can efficiently improve the current TWAVRP solution methods in 作者: perjury 時間: 2025-3-29 20:30
https://doi.org/10.1007/978-3-476-98840-9ized by considering the presence of a first-in-first-out channel linking them. Our research is motivated by applications in the context of automated warehouses management. We formalize our problem, defining eight variants which depend on the characteristics of both the pickup and delivery vehicles, 作者: EVADE 時間: 2025-3-30 00:21
https://doi.org/10.1007/978-3-662-66797-2ction graphs of paths in different underlying networks. We show that for any possible network (even if it is restricted to a path) the resulting edge intersection graphs are not necessarily superperfect and discuss some consequences.作者: 一大塊 時間: 2025-3-30 06:24
https://doi.org/10.1007/978-3-476-03612-4er analysis and synthesis. A direction-length framework is a generalisation of bar-joint framework where some distance constraints are replaced by direction constraints. We initiate a theory of Assur graphs and Assur decompositions for direction-length frameworks using graph orientations and spanning trees and then analyse choices of pinning set.作者: 從屬 時間: 2025-3-30 11:01 作者: 同謀 時間: 2025-3-30 12:23
https://doi.org/10.1007/978-3-476-03521-9on into Eulerian graph problems. Finally, we present a polynomial time algorithm to decide if an undirected and unweighted graph has the said property for .?≥?3. The question of .-hardness is left opened for other cases.作者: Spina-Bifida 時間: 2025-3-30 18:17
https://doi.org/10.1007/978-3-658-29243-0g formulation that assigns time windows to customers and selects the subset of routes of minimum expected cost. Computational results performed on benchmark instances show that our algorithm is competitive with respect to the literature, especially for instances with more than 45 customers.作者: 全神貫注于 時間: 2025-3-31 00:32 作者: 就職 時間: 2025-3-31 03:35
On Superperfection of Edge Intersection Graphs of Paths,ction graphs of paths in different underlying networks. We show that for any possible network (even if it is restricted to a path) the resulting edge intersection graphs are not necessarily superperfect and discuss some consequences.作者: Classify 時間: 2025-3-31 05:08
Assur Decompositions of Direction-Length Frameworks,er analysis and synthesis. A direction-length framework is a generalisation of bar-joint framework where some distance constraints are replaced by direction constraints. We initiate a theory of Assur graphs and Assur decompositions for direction-length frameworks using graph orientations and spanning trees and then analyse choices of pinning set.作者: 碎石 時間: 2025-3-31 11:48
Edge Tree Spanners,for the edge tree .-spanner problem for several graph classes such as trees, join of graphs, split graphs, ..-tidy, and (1, 2)-graphs. Moreover, we establish that deciding whether a graph . has an edge tree 8-spanner is .-complete, even if . is bipartite.作者: 的染料 時間: 2025-3-31 13:57 作者: maculated 時間: 2025-3-31 20:02 作者: 極力證明 時間: 2025-3-31 23:15
Synchronized Pickup and Delivery Problems with Connecting FIFO Stack,sub-problems can be solved in polynomial-time. Our proofs are constructive, consisting of resolution algorithms. We show the applicability of our results by computational experiments on instances from the literature.作者: 牽索 時間: 2025-4-1 03:41 作者: irradicable 時間: 2025-4-1 06:29 作者: Pathogen 時間: 2025-4-1 12:15
Musik zwischen Emigration und Stalinismusode of the given tree decomposition, such that it suffices to enumerate one tree decomposition per equivalence class and, for each node of the given tree decomposition, there are only a constant number of classes which can be represented in constant space.作者: 斜谷 時間: 2025-4-1 15:05
The Chromatic Polynomial of a Digraph,edges of the underlying undirected graph and will confirm the equality of our chromatic polynomial of a digraph and the chromatic polynomial of the underlying undirected graph in the case of symmetric digraphs.作者: 進(jìn)取心 時間: 2025-4-1 21:55 作者: AMBI 時間: 2025-4-2 02:43
Optimal Tree Decompositions Revisited: A Simpler Linear-Time FPT Algorithm,ode of the given tree decomposition, such that it suffices to enumerate one tree decomposition per equivalence class and, for each node of the given tree decomposition, there are only a constant number of classes which can be represented in constant space.
