標題: Titlebook: Algorithms and Discrete Applied Mathematics; First International Sumit Ganguly,Ramesh Krishnamurti Conference proceedings 2015 Springer In [打印本頁] 作者: 厭倦了我 時間: 2025-3-21 17:34
書目名稱Algorithms and Discrete Applied Mathematics影響因子(影響力)
書目名稱Algorithms and Discrete Applied Mathematics影響因子(影響力)學科排名
書目名稱Algorithms and Discrete Applied Mathematics網(wǎng)絡公開度
書目名稱Algorithms and Discrete Applied Mathematics網(wǎng)絡公開度學科排名
書目名稱Algorithms and Discrete Applied Mathematics被引頻次
書目名稱Algorithms and Discrete Applied Mathematics被引頻次學科排名
書目名稱Algorithms and Discrete Applied Mathematics年度引用
書目名稱Algorithms and Discrete Applied Mathematics年度引用學科排名
書目名稱Algorithms and Discrete Applied Mathematics讀者反饋
書目名稱Algorithms and Discrete Applied Mathematics讀者反饋學科排名
作者: cogent 時間: 2025-3-21 21:50 作者: debase 時間: 2025-3-22 02:33
https://doi.org/10.1007/978-3-642-51837-9lacing a series of calls along the edges of the graph. Every time the informed vertices aid the originator in distributing the message. Finding the broadcast time of any vertex in an arbitrary graph is NP-complete. The problem is NP-Complete for even more restricted classes of graphs, such as for 3-作者: Multiple 時間: 2025-3-22 06:58
https://doi.org/10.1007/978-3-86226-337-0flection, from the fewest possible distance queries between pairs of points. Each distance query corresponds to an edge in a graph, called point placement graph (.), whose vertex set is .. The uniqueness requirement of the placement translates to line rigidity of the .. In this paper, we show how to作者: 保存 時間: 2025-3-22 11:49 作者: CHOKE 時間: 2025-3-22 14:13
Rechtsstaat im Territorialstaat,re than 2.5 times the optimal. We revise the algorithm of Demaine?et al.?(2001) so as to achieve this ratio..(II) We prove that any collection . of . disjoint axis-parallel rectangles is cuttable by at most 4. rays and present an algorithm that runs in .(. log.) time for computing a suitable cutting作者: inculpate 時間: 2025-3-22 18:35
Rechtsstaat im historischen Sinne,allel rectangular obstacles in .. We need to preprocess the members in . such that the following query can be answered efficiently...(.,.): Given a pair of points . and ., report an axis-parallel path from . to . avoiding the obstacles in ...In the . setup, we consider a restricted version of the .(作者: PLE 時間: 2025-3-22 21:56 作者: Ordeal 時間: 2025-3-23 01:54 作者: 有節(jié)制 時間: 2025-3-23 07:21 作者: Femine 時間: 2025-3-23 12:02 作者: Synapse 時間: 2025-3-23 15:53 作者: Omniscient 時間: 2025-3-23 20:51 作者: Deadpan 時間: 2025-3-23 23:13
Seltene Regresskonstellationen,nces to the elements in the profile. The median (or antimedian) function has as output the set of medians (antimedians) of a profile. It is one of the basic models for the location of a desirable (or obnoxious) facility in a network. The median function is well studied. For instance it has been char作者: detach 時間: 2025-3-24 05:23 作者: 向外才掩飾 時間: 2025-3-24 09:10
Mittlere und Kleinere Landwirte im ReichstagSIG is an axes-parallel rectangle intersection graph where the rectangles have unit height (that is, length of the side parallel to .-axis) and intersects either of the two fixed lines, parallel to the .-axis, distance 1?+?. (0?
作者: Grasping 時間: 2025-3-24 14:02
Die Adligen Reichstagsabgeordneten of the input graph. In this paper, we study the . problem for star-convex bipartite graphs, circular-convex bipartite graphs and triad-convex bipartite graphs. It is known that the . for a graph with . vertices can be approximated within ln .. However, we show that for any .?>?0, the . problem does作者: 蓋他為秘密 時間: 2025-3-24 16:54
Mittlere und Kleinere Landwirte im Reichstaginition uses the machine based characterization of the parameterized complexity class .[.] obtained by Chen et.al [TCS 2005]. We translate most of the structural properties and characterizations of the class . to the new class .[.]?...We study a parameterization of the polynomial identity testing pr作者: 開始沒有 時間: 2025-3-24 22:46
Die Wirkungen des Reichstagswahlrechtsph called a full square rhomboid. Our intention is to simplify the expressions of full square rhomboids. We describe two decomposition methods for generating expressions of rhomboidal graphs and carry out their comparative analysis.作者: 剛毅 時間: 2025-3-25 03:01
Algorithms and Discrete Applied Mathematics978-3-319-14974-5Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: linear 時間: 2025-3-25 04:55
https://doi.org/10.33283/978-3-86298-647-7 for each ., the set {.(.) |.?∈?.} is the vertex set of a path in .? Our main result is that the existence of such a bijection from . to .(.) is equivalent to the existence of a function . from . to the set of all paths in . such that for any ., not necessarily distinct, ., .. . is referred to as a . of ..作者: Precursor 時間: 2025-3-25 07:51 作者: 其他 時間: 2025-3-25 13:51
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/a/image/153171.jpg作者: bisphosphonate 時間: 2025-3-25 18:52 作者: Vulvodynia 時間: 2025-3-25 21:16
Algebraic Expressions of Rhomboidal Graphsph called a full square rhomboid. Our intention is to simplify the expressions of full square rhomboids. We describe two decomposition methods for generating expressions of rhomboidal graphs and carry out their comparative analysis.作者: 路標 時間: 2025-3-26 01:47
https://doi.org/10.1007/978-3-319-14974-5algebraic combinatorics; approximation algorithms; combinatorial algorithms; combinatorial optimization作者: 耐寒 時間: 2025-3-26 05:49 作者: ALTER 時間: 2025-3-26 10:22 作者: 躺下殘殺 時間: 2025-3-26 16:24
0302-9743 he conference. The workshop covered a diverse range of topics on algorithms and discrete mathematics, including computational geometry, algorithms including approximation algorithms, graph theory and computational complexity.978-3-319-14973-8978-3-319-14974-5Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: anus928 時間: 2025-3-26 18:10
https://doi.org/10.1007/978-3-642-51837-9imizes: ., where .(.,.,.) is the minimum distance between nodes . and . in a graph .???.. We present a polynomial approximation scheme for the metric case of the . improving the until now best existing approximation algorithm for this problem.作者: synovitis 時間: 2025-3-26 21:48 作者: 亂砍 時間: 2025-3-27 03:53
,Rationalit?t, Recht, Legitimit?t,n edge between two points if the interior of the smallest homothet of ? having the two points on its boundary contains at most . points of .. We consider the connectivity, Hamiltonicity and perfect-matching admissibility of ..TD. Finally we consider the problem of blocking the edges of ..TD.作者: Itinerant 時間: 2025-3-27 09:05
https://doi.org/10.1007/978-3-7091-8114-0has a b-coloring using . colors is the b-chromatic number .(.) of .. A b-chromatic coloring of . denotes a b-coloring using .(.) colors. From the definition of .(.), we observe that each color class of a .-coloring contains a c.d.v. Thus .(.)?≤?.(.)?≤?.(.), where .(.) is the size of a maximum clique of ..作者: 易發(fā)怒 時間: 2025-3-27 12:53
Mittlere und Kleinere Landwirte im Reichstagoblem based on the degree of the polynomial computed by the arithmetic circuit. We obtain a parameterized analogue of the well known Schwartz-Zippel lemma [Schwartz, JACM 80 and Zippel, EUROSAM 79]..Additionally, we introduce a parameterized variant of permanent, and prove its #.[1] completeness.作者: 取之不竭 時間: 2025-3-27 14:02
,Rationalit?t, Recht, Legitimit?t,r, we show that the WEDS problem can be solved in polynomial time for a subclass of ..-free graphs, namely (.., banner)-free graphs, where a . is the graph obtained from a chordless cycle on four vertices by adding a vertex that has exactly one neighbor on the cycle.作者: 實現(xiàn) 時間: 2025-3-27 20:33
https://doi.org/10.1007/978-3-642-94312-6Laplacian eigenvalues and signless Laplacian eigenvalues of corona graphs when the basic graph is regular. Computable expressions of eigenvalues and signless Laplacian eigenvalues are also obtained when the basic graph is a star graph.作者: LINE 時間: 2025-3-27 23:58 作者: right-atrium 時間: 2025-3-28 03:50 作者: 敬禮 時間: 2025-3-28 08:20 作者: HAUNT 時間: 2025-3-28 12:16 作者: 永久 時間: 2025-3-28 14:40
On Spectra of Corona GraphsLaplacian eigenvalues and signless Laplacian eigenvalues of corona graphs when the basic graph is regular. Computable expressions of eigenvalues and signless Laplacian eigenvalues are also obtained when the basic graph is a star graph.作者: 產(chǎn)生 時間: 2025-3-28 22:45
Axiomatic Characterization of the Median and Antimedian Functions on Cocktail-Party Graphs and Complian function does not have a nice behavior on most classes. So a nice axiomatic characterization may not be expected. In this paper an axiomatic characterization is obtained for the median and antimedian functions on cocktail-party graphs. In addition a characterization of the antimedian function on complete graphs is presented.作者: 平息 時間: 2025-3-28 23:57 作者: 古代 時間: 2025-3-29 05:42
Domination in Some Subclasses of Bipartite Graphsose polynomial time algorithms for computing a minimum dominating set of circular-convex bipartite graphs and triad-convex bipartite graphs, by polynomially reducing the . problem for these graph classes to the . problem for convex bipartite graphs.作者: NIP 時間: 2025-3-29 09:08
Conference proceedings 2015in Kanpur, India, in February 2015. The volume contains 26 full revised papers from 58 submissions along with 2 invited talks presented at the conference. The workshop covered a diverse range of topics on algorithms and discrete mathematics, including computational geometry, algorithms including app作者: Lumbar-Spine 時間: 2025-3-29 12:34
0302-9743 015, held in Kanpur, India, in February 2015. The volume contains 26 full revised papers from 58 submissions along with 2 invited talks presented at the conference. The workshop covered a diverse range of topics on algorithms and discrete mathematics, including computational geometry, algorithms inc作者: BUDGE 時間: 2025-3-29 18:14 作者: 責難 時間: 2025-3-29 22:08 作者: 常到 時間: 2025-3-30 03:44
,Der Vorgang einer Belastungs?nderung,t no arc of the same partite set is properly contained in the other. In this paper, we characterize proper interval bigraphs and proper circular arc bigraphs using two linear orderings of their vertex set.作者: 迎合 時間: 2025-3-30 06:25
Three Paths to Point Placementment graph (.), whose vertex set is .. The uniqueness requirement of the placement translates to line rigidity of the .. In this paper, we show how to construct in 2 rounds a line rigid . of size 9./7?+?.(1). This improves the best known result of 4./3?+?.(1). We also improve the lower bound on 2-round algorithms from 14./13 to 9./8.作者: 百靈鳥 時間: 2025-3-30 12:08 作者: 面包屑 時間: 2025-3-30 14:16
New Characterizations of Proper Interval Bigraphs and Proper Circular Arc Bigraphst no arc of the same partite set is properly contained in the other. In this paper, we characterize proper interval bigraphs and proper circular arc bigraphs using two linear orderings of their vertex set.作者: mendacity 時間: 2025-3-30 17:25
https://doi.org/10.1007/978-3-642-51837-9lem in a simple cactus graph called .-cycle graph. For any originator we present a (2???.)-approximation algorithm in the arbitrary .-cycle graph. We also prove that our algorithm generates the optimal broadcast time for some subclasses of this graph.作者: 小口啜飲 時間: 2025-3-30 23:34
Constant Approximation for Broadcasting in ,-cycle Graphlem in a simple cactus graph called .-cycle graph. For any originator we present a (2???.)-approximation algorithm in the arbitrary .-cycle graph. We also prove that our algorithm generates the optimal broadcast time for some subclasses of this graph.作者: 有斑點 時間: 2025-3-31 04:49 作者: 生來 時間: 2025-3-31 06:09
On Collections of Polygons Cuttable with a Segment Saw sequence. In particular the same result holds for cutting with an arbitrary segment saw (of any length)..(III) In contrast, we show that there exist collections of disjoint rectangles (in arbitrary orientations) that are uncuttable by a segment saw. We also present various uncuttable collections of disjoint polygons, including triangles.作者: 詞匯表 時間: 2025-3-31 11:09
Higher-Order Triangular-Distance Delaunay Graphs: Graph-Theoretical Propertiesn edge between two points if the interior of the smallest homothet of ? having the two points on its boundary contains at most . points of .. We consider the connectivity, Hamiltonicity and perfect-matching admissibility of ..TD. Finally we consider the problem of blocking the edges of ..TD.作者: 自戀 時間: 2025-3-31 14:38 作者: brother 時間: 2025-3-31 19:28 作者: 初學者 時間: 2025-3-31 22:23
Probabilistic Arguments in Graph Coloring (Invited Talk),upper bounds but also in establishing the tightness of these upper bounds. It often calls for the application of various (often simple) ideas, tools and techniques (from probability theory) like moments, concentration inequalities, known estimates on tail probabilities and various other probability 作者: cleaver 時間: 2025-4-1 04:54
A PTAS for the Metric Case of the Minimum Sum-Requirement Communication Spanning Tree Problem minimum communication spanning tree problem (.). Given an undirected graph .?=?(.,.) with non-negative lengths .(.) associated to the edges satisfying the triangular inequality and non-negative routing weights .(.) associated to nodes .?∈?., the objective is to find a spanning tree . of ., that min
