標(biāo)題: Titlebook: Algorithms and Discrete Applied Mathematics; Third International Daya Gaur,N.S. Narayanaswamy Conference proceedings 2017 Springer Interna [打印本頁] 作者: clot-buster 時間: 2025-3-21 19:26
書目名稱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 22:20
https://doi.org/10.1007/978-3-662-34430-9e comparison graph is from a special class of graphs like chordal or comparability graphs. Finally, we make some remarks regarding the complexity of sorting with forbidden comparisons when the elements form a total order.作者: 啞劇 時間: 2025-3-22 03:05 作者: Allergic 時間: 2025-3-22 06:14 作者: 碎片 時間: 2025-3-22 12:34 作者: ascetic 時間: 2025-3-22 15:30
Voronoi Diagram for Convex Polygonal Sites with Convex Polygon-Offset Distance Function, of the nearest-site Voronoi diagram of?. convex polygonal sites, each having at most . sides, is?.. Finally, we show that the corresponding farthest-site Voronoi diagram is a tree-like structure with the same combinatorial complexity.作者: 平淡而無味 時間: 2025-3-22 19:05
Improved Bounds for Poset Sorting in the Forbidden-Comparison Regime,e comparison graph is from a special class of graphs like chordal or comparability graphs. Finally, we make some remarks regarding the complexity of sorting with forbidden comparisons when the elements form a total order.作者: prostatitis 時間: 2025-3-22 23:27 作者: 使厭惡 時間: 2025-3-23 05:15
On Structural Parameterizations of Graph Motif and Chromatic Number,split graphs, and para-.-hard when parameterized by the distance to co-graphs (which are the class of .-free graphs). On the other hand, it is known to be . when parameterized by the distance to a clique or the distance to an independent set (or equivalently, vertex cover). Towards finding the bound作者: Accommodation 時間: 2025-3-23 07:41
On Chromatic Number of Colored Mixed Graphs,lored mixed chromatic number is at most .. In particular, the last result directly improves the upper bound . of oriented chromatic number of graphs with maximum degree ., obtained by Kostochka et al. (1997, J. Graph Theory 24, 331–340) to .. We also show that there exists a connected graph with max作者: upstart 時間: 2025-3-23 12:28
https://doi.org/10.1007/978-3-662-38115-1pers present techniques to construct broadcast graphs and to obtain upper bounds on .(.). In this paper, we first find new dimensional broadcast schemes for Kn?del graphs, and then use them to give a general upper bound on .(.) for almost all odd ..作者: 消極詞匯 時間: 2025-3-23 15:42 作者: 現(xiàn)任者 時間: 2025-3-23 18:09 作者: Rebate 時間: 2025-3-23 22:34
Die Puzzleteile werden zusammengesetztnd better graph embedding capability as compared to its counterpart. The embedding problem plays a significant role in parallel and distributed systems. In this paper we devise an optimal embedding of the .-dimensional locally twisted cube onto a grid network.作者: Genetics 時間: 2025-3-24 04:30
Einige mathematische Hilfss?tzeg, Data mining, and so on, and (ii) we are interested in extending the algorithms and techniques for single point set (monochromatic) problems to bichromatic case. For all the problems considered in this paper, we design low polynomial time exact algorithms. These algorithms are based on novel techniques which might be of independent interest.作者: Conflict 時間: 2025-3-24 10:29
Querulatorische Wahnbildung und Diagnose,g vertices. These may serve as building blocks for new concepts of centrality that extend more directly, and more coherently, to more general types of data such as multilayer networks. We also give efficient algorithms to construct the associated partial rankings.作者: RADE 時間: 2025-3-24 12:35 作者: Mumble 時間: 2025-3-24 16:32
Der Begriff des Querulantenwahnsinns,em is known to be NP-hard. In this paper, we consider domination analysis of a 2-Opt heuristic for this problem. We show that the 2-Opt heuristic produces solutions no worse than the average solution in polynomial time. We also show that the domination number of the 2-Opt heuristic is at least . for . voters and . candidates.作者: abysmal 時間: 2025-3-24 19:46
Das Interpreter-Modell als VERILOG-Code,th topology intact. We present an . algorithm for min-max movement problem in a convex path-network which minimizes the maximum movement among the sensors. We also generalize our algorithm for ring, non-convex path, tethered and heterogeneous networks.作者: JADED 時間: 2025-3-24 23:13
Optimal Embedding of Locally Twisted Cubes into Grids,nd better graph embedding capability as compared to its counterpart. The embedding problem plays a significant role in parallel and distributed systems. In this paper we devise an optimal embedding of the .-dimensional locally twisted cube onto a grid network.作者: 非實體 時間: 2025-3-25 05:40
Polynomial Time Algorithms for Bichromatic Problems,g, Data mining, and so on, and (ii) we are interested in extending the algorithms and techniques for single point set (monochromatic) problems to bichromatic case. For all the problems considered in this paper, we design low polynomial time exact algorithms. These algorithms are based on novel techniques which might be of independent interest.作者: Ataxia 時間: 2025-3-25 10:01
Positional Dominance: Concepts and Algorithms,g vertices. These may serve as building blocks for new concepts of centrality that extend more directly, and more coherently, to more general types of data such as multilayer networks. We also give efficient algorithms to construct the associated partial rankings.作者: Custodian 時間: 2025-3-25 13:04
Axiomatic Characterization of the Interval Function of a Bipartite Graph,ed, simple and finite graph. We present axiomatic characterizations of the interval function of bipartite graphs and complete bipartite graphs. Further, we present an axiomatic characterization of the induced path transit function of a tree or a 4-cycle.作者: FLAGR 時間: 2025-3-25 19:04 作者: 背景 時間: 2025-3-25 22:54 作者: STIT 時間: 2025-3-26 01:22
0302-9743 m 103 submissions. They deal with the following areas: algorithms, graph theory, codes, polyhedral combinatorics, computational geometry, and discrete geometry.?.978-3-319-53006-2978-3-319-53007-9Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: JUST 時間: 2025-3-26 08:19
Grenzfragen des Nerven- und Seelenlebensoblem for a set of oblivious robots even when the robots are fully synchronous. The problem is then studied for the robots having .(1) bits persistent memory and a distributed algorithm is proposed for the problem in this model for a set of . robots. The proposed algorithm uses only two bits of persistent memory.作者: ABASH 時間: 2025-3-26 08:37 作者: instill 時間: 2025-3-26 13:53 作者: 蝕刻 時間: 2025-3-26 20:18
Optimum Gathering of Asynchronous Robots,oblem for a set of oblivious robots even when the robots are fully synchronous. The problem is then studied for the robots having .(1) bits persistent memory and a distributed algorithm is proposed for the problem in this model for a set of . robots. The proposed algorithm uses only two bits of persistent memory.作者: Melodrama 時間: 2025-3-26 22:22
Decomposing Semi-complete Multigraphs and Directed Graphs into Paths of Length Two, for a .-decomposition of a semi-complete directed graph. In particular, we show that a tournament admits a .-decomposition iff its outdegree sequence is the degree sequence of a simple undirected graph.作者: 過分 時間: 2025-3-27 02:13
On Rank and MDR Cyclic Codes of Length , Over , ,respect to rank) cyclic codes of length . over . is given. An example of the best codes over . of length 4 having largest minimum Hamming, Lee and Euclidean distances among all codes of the same rank is also given.作者: Counteract 時間: 2025-3-27 09:16 作者: Compassionate 時間: 2025-3-27 10:50 作者: SAGE 時間: 2025-3-27 13:41 作者: aesthetic 時間: 2025-3-27 20:09 作者: Mediocre 時間: 2025-3-28 01:03
https://doi.org/10.1007/978-3-319-53007-9Computer Science; clustering; colored mixed graphs; comparability; embedding; graph algorithm; minimal deg作者: 鞭子 時間: 2025-3-28 04:04 作者: GLIB 時間: 2025-3-28 09:17
Daya Gaur,N.S. NarayanaswamyIncludes supplementary material: 作者: 音樂戲劇 時間: 2025-3-28 14:12
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/a/image/153169.jpg作者: 明確 時間: 2025-3-28 18:04
Die Puzzleteile werden zusammengesetztally twisted cube is an important class of hypercube variants with the same number of nodes and connections per node, but has only half the diameter and better graph embedding capability as compared to its counterpart. The embedding problem plays a significant role in parallel and distributed system作者: fodlder 時間: 2025-3-28 20:49
Einige mathematische Hilfss?tzelems. The motivation behind studying these problems is two fold; (i) these problems appear naturally and frequently in the fields like Machine learning, Data mining, and so on, and (ii) we are interested in extending the algorithms and techniques for single point set (monochromatic) problems to bich作者: TERRA 時間: 2025-3-29 02:46 作者: 無能的人 時間: 2025-3-29 05:11
Grenzfragen des Nerven- und Seelenlebensance traversed by the robots should be minimized. One of the implications of this optimization criteria is the energy efficiency for the robots. The results of this paper are two folds. First, it is proved that multiplicity detection capability is not sufficient to solve the constrained gathering pr作者: 陰險 時間: 2025-3-29 09:01
https://doi.org/10.1007/978-3-662-34430-9to our problem is an undirected graph .(.,?.), whose edges represent the pairs that can be directly compared in constant time. We call this the .. It is also possible that the set of elements forms a partial-order, and not a total-order in which case, the sorting problem is the problem of determinin作者: 恃強凌弱 時間: 2025-3-29 14:26
Querulatorische Wahnbildung und Diagnose,esult on the preservation of the vicinal preorder in rankings obtained from common centrality indices, we review and extend notions of domination among vertices. These may serve as building blocks for new concepts of centrality that extend more directly, and more coherently, to more general types of作者: 彎腰 時間: 2025-3-29 17:44
Grenzfragen des Nerven- und Seelenlebensng .-bicriterion solution that reports cluster weights. It is well-known that running an offline algorithm on this bicriterion solution yields a .-approximation..Previously, there have been two lines of research that trade off between space and accuracy in the streaming .-median problem. To date, th作者: Insufficient 時間: 2025-3-29 21:49
Der Begriff des Querulantenwahnsinns,e query data structures. Relational event graphs generally represent social network datasets, where each graph edge carries a timestamp. We provide data structures based on colored range searching to efficiently compute several graph parameters (e.g., density, neighborhood overlap, .-index).作者: Longitude 時間: 2025-3-30 02:18
https://doi.org/10.1007/978-3-662-34430-9 graph theory. In this paper, we introduce a new axiom:.We study axiom (.) on the interval function and the induced path transit function of a connected, simple and finite graph. We present axiomatic characterizations of the interval function of bipartite graphs and complete bipartite graphs. Furthe作者: 我不死扛 時間: 2025-3-30 07:24
Der Begriff des Querulantenwahnsinns,inimizes the sum of misrepresentation values. This system does not restrict the candidates to have a minimum number of votes to be selected. The problem is known to be NP-hard. In this paper, we consider domination analysis of a 2-Opt heuristic for this problem. We show that the 2-Opt heuristic prod作者: laceration 時間: 2025-3-30 10:25
https://doi.org/10.1007/978-3-0348-7175-4icular, when a problem is already known to be polynomially solvable for some class of inputs, then it is natural to parameterize by the distance of a general instance to a tractable class. In the context of graph algorithms, parameters like vertex cover, twin cover, treewidth and treedepth modulator作者: 尖牙 時間: 2025-3-30 13:02
Der Quotienten-Differenzen-Algorithmusrphism . of an (.,?.)-colored mixed graph . to an (.,?.)-colored mixed graph . is a vertex mapping such that if . is an arc (edge) of color . in ., then .(.).(.) is an arc (edge) of color . in .. The .. . of an (.,?.)-colored mixed graph . is the order (number of vertices) of a smallest homomorphic 作者: GNAW 時間: 2025-3-30 19:15 作者: Epidural-Space 時間: 2025-3-30 22:48
Der Radio-Amateur (Radio-Telephonie)r a semi-complete multigraph, that is a multigraph with at least one edge between each pair of vertices, to have a .-decomposition. We show that this condition can be tested in strongly polynomial-time, and that the same condition applies to a larger class of multigraphs. We give a similar condition作者: 騎師 時間: 2025-3-31 03:17 作者: Amylase 時間: 2025-3-31 06:24
https://doi.org/10.1007/978-3-662-37020-9of . if there exists an . such that . for every .. In this paper we study .-distance magic labeling of the graph . for .. We obtain .-distance magic labelings of . with respect to certain classes of abelian groups. We also obtain necessary conditions for existence of such labelings.作者: Criteria 時間: 2025-3-31 10:45 作者: 辯論的終結(jié) 時間: 2025-3-31 13:42 作者: 油氈 時間: 2025-3-31 17:59 作者: Osteoarthritis 時間: 2025-3-31 21:46 作者: 合法 時間: 2025-4-1 05:39 作者: micronutrients 時間: 2025-4-1 08:26
https://doi.org/10.1007/978-3-662-38115-1We consider the problem of updating the visibility polygon of a point located within the given simple polygon as that polygon is modified with the incremental addition of new vertices to it. In particular, we propose the following two semi-dynamic algorithms:
