標(biāo)題: Titlebook: Algorithms and Discrete Applied Mathematics; 10th International C Subrahmanyam Kalyanasundaram,Anil Maheshwari Conference proceedings 2024 [打印本頁(yè)] 作者: 無(wú)感覺(jué) 時(shí)間: 2025-3-21 18:27
書(shū)目名稱Algorithms and Discrete Applied Mathematics影響因子(影響力)
書(shū)目名稱Algorithms and Discrete Applied Mathematics影響因子(影響力)學(xué)科排名
書(shū)目名稱Algorithms and Discrete Applied Mathematics網(wǎng)絡(luò)公開(kāi)度
書(shū)目名稱Algorithms and Discrete Applied Mathematics網(wǎng)絡(luò)公開(kāi)度學(xué)科排名
書(shū)目名稱Algorithms and Discrete Applied Mathematics被引頻次
書(shū)目名稱Algorithms and Discrete Applied Mathematics被引頻次學(xué)科排名
書(shū)目名稱Algorithms and Discrete Applied Mathematics年度引用
書(shū)目名稱Algorithms and Discrete Applied Mathematics年度引用學(xué)科排名
書(shū)目名稱Algorithms and Discrete Applied Mathematics讀者反饋
書(shū)目名稱Algorithms and Discrete Applied Mathematics讀者反饋學(xué)科排名
作者: 誤傳 時(shí)間: 2025-3-21 22:23 作者: 公豬 時(shí)間: 2025-3-22 02:50 作者: kyphoplasty 時(shí)間: 2025-3-22 05:13 作者: 無(wú)辜 時(shí)間: 2025-3-22 11:25 作者: inflate 時(shí)間: 2025-3-22 16:55
https://doi.org/10.1007/978-3-319-32199-8ial and adversary method. There have been considerable efforts to give lower bounds using these methods, and to compare/relate them with other measures based on the decision tree..We explore the value of these lower bounds on quantum query complexity and their relation with other decision tree based作者: 慢跑 時(shí)間: 2025-3-22 19:40 作者: 詼諧 時(shí)間: 2025-3-22 23:04
Peter Brenner MD PhD,Ghazi M. Rayan MDe . a point if the curve passes through the point. We consider such coverings by monotonic curves, lines, orthoconvex curves, circles, etc. We also study a problem that is converse of the covering problem – if a set of . points in the plane is covered by . lines then can we say something about the c作者: 漂亮才會(huì)豪華 時(shí)間: 2025-3-23 03:45 作者: 輕率看法 時(shí)間: 2025-3-23 08:01 作者: ANNUL 時(shí)間: 2025-3-23 11:57
G. Brandes,E. Reale,P. Brenner,T. K?rnerrmance of the interior point methods. This paper uses a modification to the Newton method and proposes a new way to find the search direction. We introduce a two-step interior point algorithm for solving linear optimization problems based on the new search direction. We present theoretical results f作者: BALK 時(shí)間: 2025-3-23 17:49
G. Brandes,E. Reale,P. Brenner,T. K?rnering unique least common ancestors for certain subsets of their minimal elements since these are of interest, particularly as models of phylogenetic networks. Here, we use the close connection between the canonical .-ary transit function and the closure function on a set system to show that pre-.-ary作者: 莎草 時(shí)間: 2025-3-23 18:35 作者: 改良 時(shí)間: 2025-3-23 23:47 作者: 暫時(shí)休息 時(shí)間: 2025-3-24 05:19
Sandra Kraljevic Pavelic,Ivana Ratkajin ., its neighborhood induces a subtree in .. A split graph .(.,?.) is a graph that can be partitioned into a clique (.) and an independent set (.). The objective of this study is twofold: (i) to strengthen the results presented in [.] for the Hamiltonian cycle (HCYCLE), the Hamiltonian path (HPATH作者: 北極人 時(shí)間: 2025-3-24 09:26 作者: 信任 時(shí)間: 2025-3-24 13:15 作者: Yag-Capsulotomy 時(shí)間: 2025-3-24 15:00
978-3-031-52212-3The Editor(s) (if applicable) and The Author(s), under exclusive license to Springer Nature Switzerl作者: maintenance 時(shí)間: 2025-3-24 21:48
Geometric Covering Number: Covering Points with?Curvese . a point if the curve passes through the point. We consider such coverings by monotonic curves, lines, orthoconvex curves, circles, etc. We also study a problem that is converse of the covering problem – if a set of . points in the plane is covered by . lines then can we say something about the configuration of the points?作者: 出生 時(shí)間: 2025-3-25 01:27
The Frobenius Problem for?the?Proth Numbersrobenius problem for the Proth numerical semigroup . and give formulas for the embedding dimension of .. We solve the Frobenius problem for . by giving a closed formula for the Frobenius number. Moreover, we show that . has an interesting property such as being Wilf.作者: –吃 時(shí)間: 2025-3-25 06:56
Conference proceedings 2024 in Bhilai, India?during?February 15–17, 2024..The 22 full papers included in this book were carefully reviewed and selected from 57 submissions.?They were organized in topical sections as follows: Algorithms and Complexity; Computational Geometry;?Discrete Applied Mathematics;?Graph Algorithms;?Graph Theory.. . . .作者: 持續(xù) 時(shí)間: 2025-3-25 08:27
Algorithms and Discrete Applied Mathematics978-3-031-52213-0Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: defibrillator 時(shí)間: 2025-3-25 11:57 作者: transplantation 時(shí)間: 2025-3-25 18:28 作者: 老人病學(xué) 時(shí)間: 2025-3-25 21:10
https://doi.org/10.1007/978-3-319-32199-8m is the string indexing for top-. close consecutive occurrences problem, which asks to preprocess the input text .[1?:?.] so that one can quickly answer . .: “given an integer . and a pattern ., report the . closest consecutive occurrences of . in .”. Using the same data structure mentioned above, we can answer a top-. query in .-time.作者: N斯巴達(dá)人 時(shí)間: 2025-3-26 01:18
Peter Brenner MD PhD,Ghazi M. Rayan MDthe unit squares that have a non-empty intersection. The best-known result for the MPGSC problem is an 8-approximation algorithm by Durocher et al. that runs in . time, where . is the optimal ply value [WALCOM, 2023].作者: Notify 時(shí)間: 2025-3-26 07:05 作者: LANCE 時(shí)間: 2025-3-26 11:35 作者: bonnet 時(shí)間: 2025-3-26 15:36
0302-9743 2024,?held in Bhilai, India?during?February 15–17, 2024..The 22 full papers included in this book were carefully reviewed and selected from 57 submissions.?They were organized in topical sections as follows: Algorithms and Complexity; Computational Geometry;?Discrete Applied Mathematics;?Graph Algor作者: Accord 時(shí)間: 2025-3-26 18:34
Ali Izadpanah MD, FRCSC,Marco Rizzo MDansform this geometric problem to the problem of counting triangles in the graph .. We study properties of the graph . and, in particular, show that it is kite-free. This relates the growth rate of the number of empty triangles to the famous Ruzsa-Szemerédi problem.作者: 顯示 時(shí)間: 2025-3-26 21:04 作者: Promotion 時(shí)間: 2025-3-27 03:55 作者: MILL 時(shí)間: 2025-3-27 08:25 作者: Bureaucracy 時(shí)間: 2025-3-27 11:49
Conference proceedings 2024 in Bhilai, India?during?February 15–17, 2024..The 22 full papers included in this book were carefully reviewed and selected from 57 submissions.?They were organized in topical sections as follows: Algorithms and Complexity; Computational Geometry;?Discrete Applied Mathematics;?Graph Algorithms;?Gra作者: isotope 時(shí)間: 2025-3-27 15:04 作者: 使習(xí)慣于 時(shí)間: 2025-3-27 21:21
G. Brandes,E. Reale,P. Brenner,T. K?rneror the convergence of the algorithm. Finally, we evaluate the algorithm on some test problems from the Netlib collection and show that the proposed algorithm reduces the number of iterations and CPU time by . and ., respectively.作者: Epidural-Space 時(shí)間: 2025-3-28 01:50
G. Brandes,E. Reale,P. Brenner,T. K?rner clustering systems are exactly those that derive from a class of DAGs with unique LCAs. Moreover, we show that .-ary .-systems and .-weak hierarchies are associated with DAGs that satisfy stronger conditions on the existence of unique LCAs for sets of size at most ..作者: 形狀 時(shí)間: 2025-3-28 02:58
Paul M. N. Werker,Joseph Dias,Wolfgang Wach We find that any desirable number of Kemeny rankings can also be found without substantial increase in running time. We also present . approximation algorithms for Kemeny rank aggregation with respect to these parameters.作者: 土坯 時(shí)間: 2025-3-28 08:22
Parameterized Aspects of?Distinct Kemeny Rank Aggregation We find that any desirable number of Kemeny rankings can also be found without substantial increase in running time. We also present . approximation algorithms for Kemeny rank aggregation with respect to these parameters.作者: 思考 時(shí)間: 2025-3-28 13:23
Consecutive Occurrences with?Distance Constraintsany index between them. We give deterministic solutions to the following two problems using simple and classical data structures..The first problem is to preprocess the text . so that one can efficiently answer .: “given a pattern . and a range . such that ., report all the consecutive occurrences (作者: maroon 時(shí)間: 2025-3-28 15:35
Parameterized Aspects of?Distinct Kemeny Rank Aggregationtional task of finding a Kemeny ranking has been studied under the lens of parameterized complexity with respect to many parameters. We study the parameterized complexity of the problem of computing all distinct Kemeny rankings. We consider the target Kemeny score, number of candidates, average dist作者: Ancillary 時(shí)間: 2025-3-28 19:19 作者: concise 時(shí)間: 2025-3-29 00:40 作者: geometrician 時(shí)間: 2025-3-29 06:16
On Query Complexity Measures and?Their Relations for?Symmetric Functionsial and adversary method. There have been considerable efforts to give lower bounds using these methods, and to compare/relate them with other measures based on the decision tree..We explore the value of these lower bounds on quantum query complexity and their relation with other decision tree based作者: Isometric 時(shí)間: 2025-3-29 07:16 作者: cartilage 時(shí)間: 2025-3-29 14:25 作者: 接合 時(shí)間: 2025-3-29 15:51 作者: archetype 時(shí)間: 2025-3-29 20:26
Semi-total Domination in?Unit Disk GraphsA set . is said to be a semi-total dominating set if (.) . is a dominating set, and (.) for every vertex ., there exists a vertex . such that the distance between . and . in . is within 2. Given a graph ., the semi-total domination problem is to find a semi-total dominating set of minimum cardinalit作者: Madrigal 時(shí)間: 2025-3-30 02:54 作者: 搜集 時(shí)間: 2025-3-30 06:04
Unique Least Common Ancestors and?Clusters in?Directed Acyclic Graphsing unique least common ancestors for certain subsets of their minimal elements since these are of interest, particularly as models of phylogenetic networks. Here, we use the close connection between the canonical .-ary transit function and the closure function on a set system to show that pre-.-ary作者: GLUT 時(shí)間: 2025-3-30 10:06
The Frobenius Problem for?the?Proth Numbersrobenius problem for the Proth numerical semigroup . and give formulas for the embedding dimension of .. We solve the Frobenius problem for . by giving a closed formula for the Frobenius number. Moreover, we show that . has an interesting property such as being Wilf.作者: 希望 時(shí)間: 2025-3-30 13:13 作者: jabber 時(shí)間: 2025-3-30 20:12
Impact of?Diameter and?Convex Ordering for?Hamiltonicity and?Dominationin ., its neighborhood induces a subtree in .. A split graph .(.,?.) is a graph that can be partitioned into a clique (.) and an independent set (.). The objective of this study is twofold: (i) to strengthen the results presented in [.] for the Hamiltonian cycle (HCYCLE), the Hamiltonian path (HPATH作者: PON 時(shí)間: 2025-3-30 23:20 作者: Mortal 時(shí)間: 2025-3-31 01:57
Monitoring Edge-Geodetic Sets in Graphs: Extremal Graphs, Bounds, Complexity two fundamental graph operations: clique-sum and subdivisions. In both cases, we provide a lower and an upper bound of the possible amount of changes and provide (almost) tight examples. Finally, we prove that the decision version of the problem of finding .(.) is NP-complete even for the family of
