標題: Titlebook: Algorithms and Discrete Applied Mathematics; 5th International Co Sudebkumar Prasant Pal,Ambat Vijayakumar Conference proceedings 2019 Spri [打印本頁] 作者: INFER 時間: 2025-3-21 16:23
書目名稱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讀者反饋學科排名
作者: Nonporous 時間: 2025-3-21 22:59 作者: 半圓鑿 時間: 2025-3-22 04:26
Mathematisch-physikalische Bibliothekbic bipartite planar graphs, (b) line graphs (a subclass of .-free graphs (.)), (c) .-free split graphs and (d) co-tripartite graphs. (4) The minimum induced star partition problem has (a) an .-approximation algorithm for .-free graphs (.) and (b) a 2-approximation algorithms for split graphs.作者: Nefarious 時間: 2025-3-22 07:05 作者: 遭受 時間: 2025-3-22 09:33 作者: Magnificent 時間: 2025-3-22 16:18
https://doi.org/10.1007/978-3-663-06963-8 includes a few families of regular graphs, graphs with . and split graphs. In addition, we have found bounds for the b-chromatic number of the Mycielskian of some more families of regular graphs in terms of the b-chromatic number of their original graphs.作者: 小爭吵 時間: 2025-3-22 19:08 作者: 煩憂 時間: 2025-3-22 23:38
Der Quantensprung ist keine Hexereier bound. Using this result, we determine the radio number for cartesian product of paths . and the Peterson graph .. We give a short proof for the radio number of cartesian product of paths . and complete graphs . given by Kim . in [.].作者: 谷物 時間: 2025-3-23 04:08 作者: 無法破譯 時間: 2025-3-23 08:36
0302-9743 in Kharagpur, India, in February 2019...The 22 papers presented together with 3 invited papers in this volume were carefully reviewed and selected from 86 submissions...The conference had papers in the areas of algorithms, graph theory, combinatorics, computational geometry, discrete geometry, and 作者: 怒目而視 時間: 2025-3-23 10:58
Conclusio, Empfehlungen und Ausblick, paper, we will survey some of recent techniques that underlie these developments. In particular, we discuss local convexification, Macbeath regions, Delone sets, and how to apply these concepts to develop new data structures for approximate polytope membership queries and approximate vertical ray-shooting queries.作者: 加入 時間: 2025-3-23 16:07
https://doi.org/10.1007/978-3-642-94397-3his is also the lower bound for the problem. We propose a proof of the lower bound for the problem, but for a restricted class of schemes. This proof hopefully makes progress over the ideas proposed by Radhakrishnan .?[.] and [.] towards the conjecture.作者: 寒冷 時間: 2025-3-23 20:16 作者: AWE 時間: 2025-3-23 23:37
On the Bitprobe Complexity of Two Probe Adaptive Schemes Storing Two Elements,his is also the lower bound for the problem. We propose a proof of the lower bound for the problem, but for a restricted class of schemes. This proof hopefully makes progress over the ideas proposed by Radhakrishnan .?[.] and [.] towards the conjecture.作者: intelligible 時間: 2025-3-24 05:41 作者: visceral-fat 時間: 2025-3-24 09:38
Mathematisch-physikalische Bibliotheke points in . belonging to either . or located in the given simple polygon. Note that .(.,?.) is the geodesic Euclidean distance between . and . in the case of simple polygons whereas in the case of . it is the Euclidean distance along the line segment joining . and ..作者: 庇護 時間: 2025-3-24 14:06 作者: 用肘 時間: 2025-3-24 16:36
Fault-Tolerant Additive Weighted Geometric Spanners,e points in . belonging to either . or located in the given simple polygon. Note that .(.,?.) is the geodesic Euclidean distance between . and . in the case of simple polygons whereas in the case of . it is the Euclidean distance along the line segment joining . and ..作者: 極肥胖 時間: 2025-3-24 19:30 作者: 混沌 時間: 2025-3-25 00:11
https://doi.org/10.1007/978-3-642-94397-3visibility graph of .. Further, as part of efficiently updating the visibility graph, a fully-dynamic algorithm is designed to compute the vertices of the current simple polygon that are visible from a query point.作者: ESPY 時間: 2025-3-25 04:00 作者: 大看臺 時間: 2025-3-25 10:43
Maintaining the Visibility Graph of a Dynamic Simple Polygon,visibility graph of .. Further, as part of efficiently updating the visibility graph, a fully-dynamic algorithm is designed to compute the vertices of the current simple polygon that are visible from a query point.作者: contradict 時間: 2025-3-25 13:54 作者: GET 時間: 2025-3-25 17:47 作者: 鳥籠 時間: 2025-3-26 00:01 作者: 過份艷麗 時間: 2025-3-26 01:50
A Lower Bound for the Radio Number of Graphs,er bound. Using this result, we determine the radio number for cartesian product of paths . and the Peterson graph .. We give a short proof for the radio number of cartesian product of paths . and complete graphs . given by Kim . in [.].作者: 險代理人 時間: 2025-3-26 06:08
On Selecting Leaves with Disjoint Neighborhoods in Embedded Trees,plane tree . of . leaves, . of which have been .. Each marked leaf is associated with a . (a subtree of .) and any topologically consecutive marked leaves have disjoint neighborhoods. We show how to select in linear time a constant fraction of the marked leaves that have pairwise disjoint neighborhoods.作者: 馬籠頭 時間: 2025-3-26 11:55 作者: Angiogenesis 時間: 2025-3-26 13:44
Mathematisch-physikalische Bibliothekper, we consider the problem of partitioning a graph into a minimum number of induced stars and its decision versions. This problem may be viewed as an amalgamation of the well-known dominating set problem and coloring problem. Although this problem coincides with the dominating set problem on .-fre作者: cacophony 時間: 2025-3-26 19:39
Mathematisch-physikalische Bibliothekts . is defined as . if . and it is zero if .. Here, .(.,?.) is the (geodesic) Euclidean distance between . and .. For a real number ., a graph .(.,?.) is called a . for the weighted set . of points if for any two points . and . in . the distance between . and . in graph . is at most ... for a real 作者: Indicative 時間: 2025-3-27 01:02
https://doi.org/10.1007/978-3-642-94397-3e polygon. Our algorithm takes . worst-case time to update the visibility graph when a vertex is inserted to the current simple polygon ., or when a vertex is deleted from .. Here, . is the number of combinatorial changes needed to the visibility graph due to the insertion (resp. deletion) of a vert作者: 蝕刻 時間: 2025-3-27 02:21
https://doi.org/10.1007/978-3-642-94397-3er membership queries using two bitprobes. Radhakrishnan .?[.] proposed a scheme for the problem which takes . amount of space, and conjectured that this is also the lower bound for the problem. We propose a proof of the lower bound for the problem, but for a restricted class of schemes. This proof 作者: LAST 時間: 2025-3-27 06:10 作者: 侵略者 時間: 2025-3-27 10:23
https://doi.org/10.1007/978-3-663-06963-8ed nonsingular (singular) if .(.) is nonsingular (singular). Characterizing nonsingular block graphs is an interesting open problem proposed by Bapat and Roy in 2013. In this article, we give a linear time algorithm to check whether a given block graph is singular or not.作者: CANDY 時間: 2025-3-27 15:48
https://doi.org/10.1007/978-3-663-06963-8at least one vertex adjacent to a vertex of every other color class. In this paper, we have mainly investigated on the b-chromatic number of the Mycielskian of regular graphs. In particular, we have obtained the exact value of the b-chromatic number of the Mycielskian of some classes of graphs. This作者: 忍受 時間: 2025-3-27 20:12
Widerstand gegen die Unbestimmtheitolyominoes. We explore the behavior of minimal-perimeter polyominoes when they are “inflated,” i.e., expanded by all empty cells neighboring them, and show that inflating all minimal-perimeter polyominoes of a given area create the set of all minimal-perimeter polyominoes of some larger area. We cha作者: APO 時間: 2025-3-27 22:26
Das Aufbrechen des unzerst?rten Ganzen has a rectangle intersection representation in which . horizontal lines can be placed such that each rectangle intersects at least one of them. The stab number of a graph ., denoted by .(.), is the minimum integer . such that . is a .-SRIG. In this paper, we introduce some natural subclasses of 2-S作者: Ambulatory 時間: 2025-3-28 02:42 作者: incarcerate 時間: 2025-3-28 07:55
Schneller als ein beschleunigtes Photonthat for a given query point ., we can quickly identify the smallest color spanning object of the desired type containing .. In this paper, we focus on (.) intervals, (.) axis-parallel square, (.) axis-parallel rectangle, (.) equilateral triangle of fixed orientation, as our desired type of objects.作者: Mutter 時間: 2025-3-28 11:00
Der Quantensprung ist keine Hexereidistance between . and . in ., respectively. The radio number . of . is the smallest number . such that . has radio labeling with .. In this paper, we slightly improve the lower bound for the radio number of graphs given by Das . in [.] and, give necessary and sufficient condition to achieve the low作者: 水汽 時間: 2025-3-28 16:57
und der Ursprung der Tetrapodenalled the forbidding set, such that . can be applied to a string only if none of the strings in . is present in the string, then the grammar is said to be a generalized forbidding (GF) grammar. There are four main parameters that describe the size of a GF grammar, namely, (i) ., the maximum length o作者: FRONT 時間: 2025-3-28 22:41 作者: 羊齒 時間: 2025-3-29 01:05
Der Quantensprung ist keine HexereiWe give a polynomial-time algorithm to decide whether a bipartite graph admits a two-layer drawing in the plane such that a specified subset of pairs of edges cross. This is a generalization of the problem of recognizing permutation graphs, and we generalize the characterization of permutation graphs.作者: ANTE 時間: 2025-3-29 05:10
Drawing Bipartite Graphs in Two Layers with Specified Crossings,We give a polynomial-time algorithm to decide whether a bipartite graph admits a two-layer drawing in the plane such that a specified subset of pairs of edges cross. This is a generalization of the problem of recognizing permutation graphs, and we generalize the characterization of permutation graphs.作者: 使成整體 時間: 2025-3-29 08:38 作者: 山崩 時間: 2025-3-29 12:33
Linear Time Algorithm to Check the Singularity of Block Graphs,ed nonsingular (singular) if .(.) is nonsingular (singular). Characterizing nonsingular block graphs is an interesting open problem proposed by Bapat and Roy in 2013. In this article, we give a linear time algorithm to check whether a given block graph is singular or not.作者: 去才蔑視 時間: 2025-3-29 17:49
Localized Query: Color Spanning Variations,that for a given query point ., we can quickly identify the smallest color spanning object of the desired type containing .. In this paper, we focus on (.) intervals, (.) axis-parallel square, (.) axis-parallel rectangle, (.) equilateral triangle of fixed orientation, as our desired type of objects.作者: GLIDE 時間: 2025-3-29 23:32
Conference proceedings 2019pur, India, in February 2019...The 22 papers presented together with 3 invited papers in this volume were carefully reviewed and selected from 86 submissions...The conference had papers in the areas of algorithms, graph theory, combinatorics, computational geometry, discrete geometry, and computational complexity..作者: 農(nóng)學 時間: 2025-3-30 01:22 作者: agnostic 時間: 2025-3-30 08:04
Algorithms and Discrete Applied Mathematics978-3-030-11509-8Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: MORT 時間: 2025-3-30 08:53
,Kognitionstheoretische Vorüberlegungen, sum is an .-.. We show that . is bipartite and for ., . has exactly . components. We also find the values of . such that . contains cycles as subgraphs. We also use this graph to partition the set . into . subsets such that each subset is ordered in such a way that sum of any 2 consecutive terms is an .-..作者: FLORA 時間: 2025-3-30 15:00
https://doi.org/10.1007/978-3-663-06963-8ed nonsingular (singular) if .(.) is nonsingular (singular). Characterizing nonsingular block graphs is an interesting open problem proposed by Bapat and Roy in 2013. In this article, we give a linear time algorithm to check whether a given block graph is singular or not.作者: somnambulism 時間: 2025-3-30 16:41 作者: 卵石 時間: 2025-3-31 00:09
https://doi.org/10.1007/978-3-030-11509-8approximation algorithms; bipartite graphs; coloring; graph theory; graphic methods; planar graph; algorit作者: 乳汁 時間: 2025-3-31 04:30 作者: 自制 時間: 2025-3-31 06:55 作者: 增強 時間: 2025-3-31 11:02
The Induced Star Partition of Graphs,per, we consider the problem of partitioning a graph into a minimum number of induced stars and its decision versions. This problem may be viewed as an amalgamation of the well-known dominating set problem and coloring problem. Although this problem coincides with the dominating set problem on .-fre作者: craven 時間: 2025-3-31 16:44 作者: 形上升才刺激 時間: 2025-3-31 17:37
Maintaining the Visibility Graph of a Dynamic Simple Polygon,e polygon. Our algorithm takes . worst-case time to update the visibility graph when a vertex is inserted to the current simple polygon ., or when a vertex is deleted from .. Here, . is the number of combinatorial changes needed to the visibility graph due to the insertion (resp. deletion) of a vert作者: 財主 時間: 2025-4-1 00:44
