標(biāo)題: Titlebook: Algorithms and Discrete Applied Mathematics; 9th International Co Amitabha Bagchi,Rahul Muthu Conference proceedings 2023 The Editor(s) (if [打印本頁] 作者: 萬能 時間: 2025-3-21 17:34
書目名稱Algorithms and Discrete Applied Mathematics影響因子(影響力)
書目名稱Algorithms and Discrete Applied Mathematics影響因子(影響力)學(xué)科排名
書目名稱Algorithms and Discrete Applied Mathematics網(wǎng)絡(luò)公開度
書目名稱Algorithms and Discrete Applied Mathematics網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Algorithms and Discrete Applied Mathematics被引頻次
書目名稱Algorithms and Discrete Applied Mathematics被引頻次學(xué)科排名
書目名稱Algorithms and Discrete Applied Mathematics年度引用
書目名稱Algorithms and Discrete Applied Mathematics年度引用學(xué)科排名
書目名稱Algorithms and Discrete Applied Mathematics讀者反饋
書目名稱Algorithms and Discrete Applied Mathematics讀者反饋學(xué)科排名
作者: Feckless 時間: 2025-3-22 00:16 作者: 上釉彩 時間: 2025-3-22 02:26
Fault-Tolerant Dispersion of?Mobile Robotsode anonymous graph. The goal is to ensure that regardless of the initial placement of the robots over the nodes, the final configuration consists of having at most one robot at each node. In a crash-fault setting, up to . robots may fail by crashing arbitrarily and subsequently lose all the informa作者: 杠桿支點 時間: 2025-3-22 06:52 作者: Acetaldehyde 時間: 2025-3-22 11:39
Algorithms for?,-Dispersion for?Points in?Convex Position in?the?Planethe objective is to compute a subset . such that . and the minimum distance between a pair of points in . is maximized. Based on the bounded search tree method, we propose an exact fixed-parameter algorithm in . time for this problem, where . is the parameter. The proposed exact algorithm improves o作者: esoteric 時間: 2025-3-22 13:54 作者: 護航艦 時間: 2025-3-22 19:23 作者: Epithelium 時間: 2025-3-22 22:41 作者: NIB 時間: 2025-3-23 05:27
New Bounds and?Constructions for?Neighbor-Locating Colorings of?Graphs are different. The neighbor-locating chromatic number . is the minimum . for which . admits a neighbor-locating .-coloring. A proper .-vertex-coloring of a graph . is a . . if for each pair of vertices . and . in the same color-class, there exists a color class . such that .. The locating chromatic作者: 富饒 時間: 2025-3-23 08:49 作者: Introduction 時間: 2025-3-23 12:38 作者: 遺產(chǎn) 時間: 2025-3-23 15:22 作者: 缺陷 時間: 2025-3-23 21:08 作者: 要塞 時間: 2025-3-23 23:26 作者: agitate 時間: 2025-3-24 04:15 作者: jungle 時間: 2025-3-24 09:26
https://doi.org/10.1007/978-3-319-58025-8e show that the lid-chromatic number of a biconvex bipartite graph can be computed in polynomial time. Finally, we find the lid-chromatic number of the Cartesian and Lexicographic products of paths and cycles.作者: agglomerate 時間: 2025-3-24 12:29 作者: 痛恨 時間: 2025-3-24 18:44 作者: Exploit 時間: 2025-3-24 22:41 作者: 指數(shù) 時間: 2025-3-25 00:47 作者: 法官 時間: 2025-3-25 04:13
On Coupon Coloring of?Cayley Graphsand only if there is a lower triangular matrix . over . whose entries on the main diagonal are non-zero and such that . or ., where . is the transpose of the matrix .. In this paper, we have studied the coupon coloring of . and generalized Cayley graph ..作者: grounded 時間: 2025-3-25 09:05 作者: 江湖騙子 時間: 2025-3-25 13:46 作者: anarchist 時間: 2025-3-25 15:54 作者: Flawless 時間: 2025-3-25 22:48 作者: IVORY 時間: 2025-3-26 02:51
Kontextanalyse junger Wachstumsunternehmen,o characterize rings, posets and reduced semigroups whose zero-divisor graphs and ideal based zero-divisor graphs are perfect. As a consequence, we characterize distributive lattices with 0, reduced semirings and boolean rings whose zero divisor graphs are perfect, which are proved in (Patil et al. in Discrete Math. 340: 740–745, 2017).作者: Inflamed 時間: 2025-3-26 07:50
Maschinenorientierte Programmiersprachen,unction for .-free graphs. In addition, we show that if ., then any .-free graph . with no components of clique size two admits a linear .-binding function. Furthermore, we also establish that any connected .-free graph . where ., is perfect for ..作者: 完成 時間: 2025-3-26 12:13
Perfectness of?,-generalized Join of?Graphso characterize rings, posets and reduced semigroups whose zero-divisor graphs and ideal based zero-divisor graphs are perfect. As a consequence, we characterize distributive lattices with 0, reduced semirings and boolean rings whose zero divisor graphs are perfect, which are proved in (Patil et al. in Discrete Math. 340: 740–745, 2017).作者: ingenue 時間: 2025-3-26 14:08
Coloring of?a?Superclass of?,-free graphsunction for .-free graphs. In addition, we show that if ., then any .-free graph . with no components of clique size two admits a linear .-binding function. Furthermore, we also establish that any connected .-free graph . where ., is perfect for ..作者: Trabeculoplasty 時間: 2025-3-26 20:49
Conference proceedings 2023e papers were organized in topical sections named: algorithms and optimization; computational geometry; game theory; graph coloring; graph connectivity; graph domination; graph matching; graph partition and graph covering..作者: 埋伏 時間: 2025-3-26 23:37 作者: Tremor 時間: 2025-3-27 02:19 作者: stroke 時間: 2025-3-27 07:36
Der Ratgeber für dein BWL Studiumn the algorithm of Akagi et al. (2018), which requires time ., whenever . for some constant .. We then give an exact polynomial-time (.) algorithm, for any ., thus answering the open question about the complexity of this restricted dispersion problem. For ., there is an .-time algorithm by Kobayashi et?al. (2021).作者: 類型 時間: 2025-3-27 13:26
Kontextanalyse junger Wachstumsunternehmen,iate a study of . from the parameterized complexity perspective. We show that . is fixed-parameter tractable when parameterized by (a) neighborhood diversity, (b) twin-cover, and (c) the combined parameters clique-width and the number of colors.作者: 正面 時間: 2025-3-27 13:44
Optimal Length Cutting Plane Refutations of?Integer Programs length of the shortest refutation of each type (read-once, tree-like, and dag-like). In this paper, we show that the problem of finding the shortest read-once refutation is .. Additionally, we show that the problem of finding the shortest tree-like refutation is . for IPs. We also show that the pro作者: 一小塊 時間: 2025-3-27 18:55
Fault-Tolerant Dispersion of?Mobile Robotsthe robots are placed in some . clusters arbitrarily across the graph. For the first case, we develop an algorithm solving dispersion in the presence of faulty robots in . rounds, which improves over the previous .-round result by [.]. For the arbitrary configuration, we present an algorithm solving作者: 漂亮 時間: 2025-3-28 01:51
Arbitrary-Oriented Color Spanning Region for?Line Segmentsplexities of the proposed algorithms for these problems are: (i) ., (ii) . , (iii) ., and (iv) .. Better algorithm with reduced time complexities can be achieved for problems (ii) and (iii) if some restrictions are imposed on the relative orientation of the outputs. Each of these problems needs line作者: 自由職業(yè)者 時間: 2025-3-28 05:16 作者: 冰雹 時間: 2025-3-28 06:50
Lehrapparaturen. Morsezeichenlehr-apparate., length of the shortest refutation of each type (read-once, tree-like, and dag-like). In this paper, we show that the problem of finding the shortest read-once refutation is .. Additionally, we show that the problem of finding the shortest tree-like refutation is . for IPs. We also show that the pro作者: 偶像 時間: 2025-3-28 12:14
https://doi.org/10.1007/978-3-642-94587-8the robots are placed in some . clusters arbitrarily across the graph. For the first case, we develop an algorithm solving dispersion in the presence of faulty robots in . rounds, which improves over the previous .-round result by [.]. For the arbitrary configuration, we present an algorithm solving作者: NOMAD 時間: 2025-3-28 16:41
Der Ratgeber für dein BWL Studiumplexities of the proposed algorithms for these problems are: (i) ., (ii) . , (iii) ., and (iv) .. Better algorithm with reduced time complexities can be achieved for problems (ii) and (iii) if some restrictions are imposed on the relative orientation of the outputs. Each of these problems needs line作者: ensemble 時間: 2025-3-28 19:08 作者: Acupressure 時間: 2025-3-29 00:36 作者: 不要不誠實 時間: 2025-3-29 04:02
5-List Coloring Toroidal 6-Regular Triangulations in?Linear TimeWe give an explicit procedure for 5-list coloring a large class of toroidal 6-regular triangulations in linear time. We also show that these graphs are not 3-choosable.作者: pineal-gland 時間: 2025-3-29 07:51 作者: Affluence 時間: 2025-3-29 13:27 作者: 灰心喪氣 時間: 2025-3-29 17:24
Der Realismus - in der theoretischen Physikr polygon. The players wish to maximize the net number of their clients where a client is served by the nearest facility of players in . metric. We prove the tight bounds for the payoffs of both the players for the class of games with simple, convex and orthogonal convex polygons. We also generalize the results for . metric in the plane.作者: 幸福愉悅感 時間: 2025-3-29 19:49 作者: 和平主義 時間: 2025-3-30 02:55 作者: 考得 時間: 2025-3-30 06:32
978-3-031-25210-5The Editor(s) (if applicable) and The Author(s), under exclusive license to Springer Nature Switzerl作者: ANNUL 時間: 2025-3-30 09:30
Rectilinear Voronoi Games with?a?Simple Rectilinear Obstacle in?Planer polygon. The players wish to maximize the net number of their clients where a client is served by the nearest facility of players in . metric. We prove the tight bounds for the payoffs of both the players for the class of games with simple, convex and orthogonal convex polygons. We also generalize the results for . metric in the plane.作者: 誘拐 時間: 2025-3-30 13:08
Diverse Fair Allocations: Complexity and?Algorithmsons of disjoint, distinct and symmetric allocations and study their complexity in terms of the fairness notions of . and .. We show that for binary valuations, the above problems are polynomial time solvable. In contrast we show NP-hardness of disjoint and symmetric case, when the valuations are additive.作者: 豐富 時間: 2025-3-30 19:10
Der Radio-Amateur ?Broadcasting“roblem where the multiplication operation is replaced by addition. There is a pseudopolynomial-time dynamic programming algorithm which solves the . in .(.) time and . space..In this paper, we present a simple and elegant randomized algorithm for . in . expected-time. Moreover, we also present a . t作者: synovium 時間: 2025-3-30 23:21 作者: ineluctable 時間: 2025-3-31 01:27
https://doi.org/10.1007/978-3-642-94587-8ode anonymous graph. The goal is to ensure that regardless of the initial placement of the robots over the nodes, the final configuration consists of having at most one robot at each node. In a crash-fault setting, up to . robots may fail by crashing arbitrarily and subsequently lose all the informa作者: Radiation 時間: 2025-3-31 05:15
https://doi.org/10.1007/978-3-642-94587-8at i) at most one sub-channel is used for each D2D pair, and ii) the total interference is at most the required maximum. Our model can also minimize the interference subject to a guaranteed total sum rate. We give a branch-n-cut algorithm. We provide an iterative rounding algorithm that achieves at
