標(biāo)題: Titlebook: Algorithms and Discrete Applied Mathematics; 6th International Co Manoj Changat,Sandip Das Conference proceedings 2020 Springer Nature Swit [打印本頁] 作者: Lensometer 時間: 2025-3-21 17:33
書目名稱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é)科排名
作者: 排名真古怪 時間: 2025-3-21 23:08
Partitioning Cographs into Two Forests and One Independent Setbut polynomial-time solvable in the class of cographs; in fact, for each . and . there are only finitely many minimal non-partitionable cographs. In previous investigations it was revealed that when . or ., these minimal non-partitionable cographs can be uniformly described as one family of obstruct作者: 膠水 時間: 2025-3-22 00:50
Monitoring the Edges of a Graph Using Distancesis a vertex . of . and a vertex . of . such that . belongs to all shortest paths between . and .. We denote by . the smallest size of such a set in .. The vertices of . represent distance probes in a network modeled by .; when the edge . fails, the distance from . to . increases, and thus we are abl作者: Sad570 時間: 2025-3-22 07:50
The Lexicographic Method for the Threshold Cover Problemng and obtaining representations of comparability graphs, proper circular-arc graphs and proper interval graphs. This method gives rise to conceptually simple recognition algorithms and leads to much simpler proofs for some characterization theorems for these classes. Threshold graphs are a class of作者: dendrites 時間: 2025-3-22 10:35 作者: 苦澀 時間: 2025-3-22 13:16 作者: Immortal 時間: 2025-3-22 17:59 作者: 正式演說 時間: 2025-3-22 22:13
Hardness Results of Global Total ,-Domination Problem in Graphsroblem is to find a global total .-dominating set of minimum cardinality of the input graph . and . .-. problem is the decision version of . .-. problem. The . . . problem is known to be NP-complete for general graphs. In this paper, we study the complexity of the . .-. problem. We show the . .-. pr作者: institute 時間: 2025-3-23 02:40
Hardness and Approximation for the Geodetic Set Problem in Some Graph Classesme shortest path between some pair of vertices from .. The . problem is to find a geodetic set with minimum cardinality. In this paper, we prove that solving . is NP-hard on planar graphs with a maximum degree six and line graphs. We also show that unless ., there is no polynomial time algorithm to 作者: DEBT 時間: 2025-3-23 06:14 作者: Incompetent 時間: 2025-3-23 12:33 作者: Spinous-Process 時間: 2025-3-23 14:21 作者: 意外的成功 時間: 2025-3-23 20:18 作者: Munificent 時間: 2025-3-23 23:21
Indicated Coloring of Complete Expansion and Lexicographic Product of Graphs[.] is .-indicated colorable for all .. Also, we show that for any graph . and for some classes of graphs . with ., .[.] is .-indicated colorable if and only if . is .-indicated colorable. As a consequence of this result we show that if .Chordal graphs, Cographs, .-free graphs, Complete multipartite作者: GET 時間: 2025-3-24 02:28
Smallest ,-Critical Graphs of Odd-Girth aphs are the classic .-(colour)-critical graphs. This work is a first step towards extending questions of extremal nature from .-critical graphs to .-critical graphs. Besides complete graphs, the next classic case is odd cycles. Thus, given integers . we ask: what is the smallest order . of a .-crit作者: hermitage 時間: 2025-3-24 07:20 作者: Myocarditis 時間: 2025-3-24 11:36 作者: 使混合 時間: 2025-3-24 15:55 作者: 淡紫色花 時間: 2025-3-24 20:41
Hardness and Approximation for the Geodetic Set Problem in Some Graph Classessolve . with sublogarithmic approximation factor (in terms of the number of vertices) even on graphs with diameter 2. On the positive side, we give an .-approximation algorithm for . on general graphs of order .. We also give a 3-approximation algorithm for . on solid grid graphs which are planar.作者: oxidant 時間: 2025-3-25 00:14 作者: LAP 時間: 2025-3-25 04:27
Self-centeredness of Generalized Petersen Graphs odd and . is even. We also prove non-self-centeredness of generalized Petersen graphs .(.,?.) when . even with .; . with . for some positive integer .; . is odd and . or .; and . with . for any positive integer .. Finally, we make an exhaustive computer search and get all possible values of . and . for which .(.,?.) is non-self-centered.作者: AWL 時間: 2025-3-25 09:37 作者: 我沒有強迫 時間: 2025-3-25 13:03 作者: synchronous 時間: 2025-3-25 19:10 作者: Allowance 時間: 2025-3-25 20:59
https://doi.org/10.1007/978-3-7985-1578-9s work, we consider these problems in two restricted settings: (i) collinear points and (ii) equidistant points on a circle. We show that almost all of these problems can be solved in linear time in these constrained, yet non-trivial settings.作者: Arroyo 時間: 2025-3-26 03:02 作者: 拱形面包 時間: 2025-3-26 07:36 作者: 豪華 時間: 2025-3-26 09:31 作者: 甜得發(fā)膩 時間: 2025-3-26 13:04
Untersuchung der Vena saphena parva,e . and girth at least six is .-rs colourable, and thereby answer a problem posed by Shalu and Sandhya (Graphs and Combinatorics 2016). In addition, we design an . algorithm to test whether a chordal graph is 3-rs colourable.作者: 射手座 時間: 2025-3-26 17:13
Sonographie nach dem chirurgischen Eingriff,oblem remains NP-complete for bipartite graphs and chordal graphs. Next, we show that the . .-. problem admits a constant approximation algorithm for bounded degree graphs. Finally, we show that the . .-. problem is APX-complete for bounded degree graphs.作者: 現(xiàn)實 時間: 2025-3-26 23:25
,Anatomie des oberfl?chlichen Venensystems,solve . with sublogarithmic approximation factor (in terms of the number of vertices) even on graphs with diameter 2. On the positive side, we give an .-approximation algorithm for . on general graphs of order .. We also give a 3-approximation algorithm for . on solid grid graphs which are planar.作者: 遍及 時間: 2025-3-27 04:03 作者: Biofeedback 時間: 2025-3-27 06:26
Erika Mendoza,Hans-Peter Weskott,Helmut Kopf odd and . is even. We also prove non-self-centeredness of generalized Petersen graphs .(.,?.) when . even with .; . with . for some positive integer .; . is odd and . or .; and . with . for any positive integer .. Finally, we make an exhaustive computer search and get all possible values of . and . for which .(.,?.) is non-self-centered.作者: 救護(hù)車 時間: 2025-3-27 12:57 作者: CULP 時間: 2025-3-27 16:02
Sonographie bei der Therapie der Varikose,n bondage number . of a graph . with maximum degree at least two is the minimum cardinality of all sets . for which .(.) .. In this paper we determine the exact values of the weak Roman bondage number for paths, cycles and complete bipartite graphs. We obtain bounds for trees and unicyclic graphs and characterize the extremal graphs.作者: 玉米 時間: 2025-3-27 21:35
,Thrombose der oberfl?chlichen Beinvenen,dding a new vertex . for each vertex . of . and joining . to the neighbors of . in .. In this paper, we study the geodetic and hull numbers of shadow graphs. Bounds for the geodetic and hull numbers of shadow graphs are obtained and for several classes exact values are determined. Graphs . for which . are characterized.作者: 合同 時間: 2025-3-28 00:39
A. Caggiati,E. Mendoza,R. Murena-Schmidte graphs which contain an induced ., ., .-free graphs, connected . .-free graphs which contain an induced ., then .[.] is .-indicated colorable for every .. This serves as a partial answer to one of the questions raised by Grzesik in [.].作者: stratum-corneum 時間: 2025-3-28 04:17 作者: Employee 時間: 2025-3-28 10:08
On the Geodetic and Hull Numbers of Shadow Graphsdding a new vertex . for each vertex . of . and joining . to the neighbors of . in .. In this paper, we study the geodetic and hull numbers of shadow graphs. Bounds for the geodetic and hull numbers of shadow graphs are obtained and for several classes exact values are determined. Graphs . for which . are characterized.作者: vocation 時間: 2025-3-28 11:21
Indicated Coloring of Complete Expansion and Lexicographic Product of Graphse graphs which contain an induced ., ., .-free graphs, connected . .-free graphs which contain an induced ., then .[.] is .-indicated colorable for every .. This serves as a partial answer to one of the questions raised by Grzesik in [.].作者: lethargy 時間: 2025-3-28 17:51 作者: admission 時間: 2025-3-28 20:24
Sonographie bei der Therapie der Varikose,ompromise that maintains some of the algebraic structure. Among the main results in the paper, we show that minimal .-modules can be computed in polynomial time, on the other hand for maximal .-modules it is already NP-hard to compute if a graph admits an 1-parallel decomposition, i.e. one step of decomposition of .-module with ..作者: 承認(rèn) 時間: 2025-3-29 00:33 作者: 正式演說 時間: 2025-3-29 04:58
Sonographie bei der Therapie der Varikose,ne independent set. Since our proof is algorithmic, we can apply our characterization to complement the recognition algorithm for partitionable cographs by an algorithm to certify non-partitionable cographs by finding a forbidden induced subgraph.作者: 懶惰人民 時間: 2025-3-29 08:05 作者: 租約 時間: 2025-3-29 12:41
Untersuchung der Vena saphena parva,he general case by Cozzens and Leibowitz, it was shown to be true for graphs having a threshold cover of size 2 by Raschle and Simon?[., STOC ’95, pages 650–661, 1995]. That is, a graph . has a threshold cover of size 2 if and only if . is bipartite—this is the only known forbidden structure charact作者: 路標(biāo) 時間: 2025-3-29 19:26
Duplexsonographie in der Venendiagnostikwith a different proof. In this paper we find Ramsey numbers for line graph of multi graphs thereby extending the results of Chvátal and Hanson. Here we determine the maximum number of edges that a multigraph can have, when its matching number, multiplicity, and maximum degree are bounded, and chara作者: Organonitrile 時間: 2025-3-29 22:58 作者: 祝賀 時間: 2025-3-30 01:22 作者: Critical 時間: 2025-3-30 07:41 作者: AVANT 時間: 2025-3-30 10:38
Ramsey Numbers for Line Graphswith a different proof. In this paper we find Ramsey numbers for line graph of multi graphs thereby extending the results of Chvátal and Hanson. Here we determine the maximum number of edges that a multigraph can have, when its matching number, multiplicity, and maximum degree are bounded, and chara作者: 取消 時間: 2025-3-30 14:56 作者: Trypsin 時間: 2025-3-30 19:00 作者: 者變 時間: 2025-3-30 21:39 作者: 爭吵 時間: 2025-3-31 03:15 作者: MORPH 時間: 2025-3-31 07:15 作者: Myofibrils 時間: 2025-3-31 09:47 作者: 痛打 時間: 2025-3-31 16:16 作者: curettage 時間: 2025-3-31 17:40
Sonographie bei der Therapie der Varikose,of vertices that have the . same neighbourhood to the outside. These are known as modules and there exist linear-time algorithms to find them. This notion however is too strict, especially when dealing with graphs that arise from real world data. This is why it is important to relax this condition b作者: 百靈鳥 時間: 2025-4-1 00:21 作者: ungainly 時間: 2025-4-1 04:26
