標(biāo)題: Titlebook: WALCOM: Algorithms and Computation; 4th International Wo Md. Saidur Rahman,Satoshi Fujita Conference proceedings 2010 Springer-Verlag Berli [打印本頁] 作者: 難免 時間: 2025-3-21 17:37
書目名稱WALCOM: Algorithms and Computation影響因子(影響力)
書目名稱WALCOM: Algorithms and Computation影響因子(影響力)學(xué)科排名
書目名稱WALCOM: Algorithms and Computation網(wǎng)絡(luò)公開度
書目名稱WALCOM: Algorithms and Computation網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱WALCOM: Algorithms and Computation被引頻次
書目名稱WALCOM: Algorithms and Computation被引頻次學(xué)科排名
書目名稱WALCOM: Algorithms and Computation年度引用
書目名稱WALCOM: Algorithms and Computation年度引用學(xué)科排名
書目名稱WALCOM: Algorithms and Computation讀者反饋
書目名稱WALCOM: Algorithms and Computation讀者反饋學(xué)科排名
作者: 制造 時間: 2025-3-21 21:53
A Simple Algorithm for Approximate Partial Point Set Pattern Matching under Rigid Motiond motion in .(....(.log.?+?log.)) time. If only translation is considered then the existence of a match can be tested in .(... log.) time. The salient feature of our algorithm for the rigid motion and translation is that it avoids the use of intersection of high degree curves.作者: cluster 時間: 2025-3-22 01:42 作者: 冒煙 時間: 2025-3-22 06:18
A Simple and Faster Branch-and-Bound Algorithm for Finding a Maximum Cliquehigh density and for very large and sparse graphs, even though MCS is not designed for any particular type of graphs. MCS can be faster than MCR by a factor of more than 100,000 for some extremely dense random graphs.作者: Contend 時間: 2025-3-22 10:00
Acyclically 3-Colorable Planar Graphsy planar graph has a subdivision with one vertex per edge that is acyclically 3-colorable. Finally, we characterize the series-parallel graphs such that every 3-coloring is acyclic and we provide a linear-time recognition algorithm for such graphs.作者: 斷斷續(xù)續(xù) 時間: 2025-3-22 14:30
Acyclically 3-Colorable Planar Graphsy planar graph has a subdivision with one vertex per edge that is acyclically 3-colorable. Finally, we characterize the series-parallel graphs such that every 3-coloring is acyclic and we provide a linear-time recognition algorithm for such graphs.作者: cartilage 時間: 2025-3-22 19:40 作者: Exclaim 時間: 2025-3-22 22:19
On Some Simple Widthsass . of cographs we show that .-width is NP-complete. We show that the recognition is fixed-parameter tractable, and we show that there exists a finite obstruction set. We introduce simple-width as an alternative for rankwidth and we characterize the graphs with simple-width at most two.作者: Psychogenic 時間: 2025-3-23 03:16 作者: Range-Of-Motion 時間: 2025-3-23 06:05 作者: 有雜色 時間: 2025-3-23 13:31 作者: headlong 時間: 2025-3-23 17:54 作者: Mhc-Molecule 時間: 2025-3-23 19:13 作者: 吞噬 時間: 2025-3-23 23:11
Harmonious Coloring on Subclasses of Colinear Graphsar graphs. Moreover, we provide a polynomial solution for the harmonious coloring problem for the class of split strongly chordal graphs, the interest of which lies on the fact that the problem has been proved to be NP-complete on both split and strongly chordal graphs.作者: FEIGN 時間: 2025-3-24 04:59
Crossings between Curves with Many Tangenciesove every curve in . and that there are . pairs of curves, one from . and the other from ., that are tangent to each other. Then the number of proper crossings among the members of . is at least (1/2???.(1)). ln .. This bound is almost tight.作者: grieve 時間: 2025-3-24 08:04
Constant-Work-Space Algorithm for a Shortest Path in a Simple Polygonalled “computing instead of storing”, we can design a naive quadratic-time algorithm for the problem using only constant work space, i.e., .(log.) bits in total for the work space, where . is the number of nodes in the tree. Then, another technique “controlled recursion” improves the time bound to .作者: 東西 時間: 2025-3-24 13:03 作者: CRANK 時間: 2025-3-24 17:51 作者: 債務(wù) 時間: 2025-3-24 20:24 作者: 口音在加重 時間: 2025-3-25 01:59 作者: 陳腐的人 時間: 2025-3-25 05:59
A Global ,-Level Crossing Reduction Algorithmossing minimizations, which are still .-hard..We introduce a global crossing reduction, which at any particular time captures all crossings, especially for long edges. Our approach is based on the sifting technique and improves the level-by-level heuristics in the hierarchic framework by a further r作者: minimal 時間: 2025-3-25 10:24
Constant-Work-Space Algorithm for a Shortest Path in a Simple Polygonalled “computing instead of storing”, we can design a naive quadratic-time algorithm for the problem using only constant work space, i.e., .(log.) bits in total for the work space, where . is the number of nodes in the tree. Then, another technique “controlled recursion” improves the time bound to .作者: municipality 時間: 2025-3-25 12:40 作者: 圖畫文字 時間: 2025-3-25 15:59 作者: WAG 時間: 2025-3-25 22:41 作者: 慌張 時間: 2025-3-26 03:51
Small Grid Drawings of Planar Graphs with Balanced Bipartitionrsection. It has been known that every planar graph . of . vertices has a grid drawing on an (.???2)×(.???2) integer grid and such a drawing can be found in linear time. In this paper we show that if a planar graph . has a balanced bipartition then . has a grid drawing with small grid area. More pre作者: BALE 時間: 2025-3-26 07:39
Acyclically 3-Colorable Planar Graphsmaximum degree 4 and we show that there exist infinite classes of cubic planar graphs that are not acyclically 3-colorable. Further, we show that every planar graph has a subdivision with one vertex per edge that is acyclically 3-colorable. Finally, we characterize the series-parallel graphs such th作者: Chronological 時間: 2025-3-26 08:41 作者: 針葉樹 時間: 2025-3-26 12:38 作者: 無意 時間: 2025-3-26 18:55 作者: optic-nerve 時間: 2025-3-27 00:10 作者: 沖擊力 時間: 2025-3-27 05:04
Computation of Non-dominated Points Using Compact Voronoi Diagrams is non-dominated if and only if for each ..?∈?., ., there exists at least one point .?∈?. that is closer to .. than ... We reduce this problem of determining non-dominated points to the problem of finding sites that have non-empty cells in an additively weighted Voronoi diagram under convex distanc作者: Acetaldehyde 時間: 2025-3-27 08:10 作者: 安慰 時間: 2025-3-27 11:34
A Simple Algorithm for Approximate Partial Point Set Pattern Matching under Rigid Motionith a subset of . under rigid motion (rotation and/or translation) transformation such that each point in . lies in the .-neighborhood of a point in .. The .-neighborhood region of a point ..?∈?. is an axis-parallel square having each side of length . and .. at its centroid. We assume that the point作者: fastness 時間: 2025-3-27 16:41 作者: Factorable 時間: 2025-3-27 19:17
Acyclically 3-Colorable Planar Graphsmaximum degree 4 and we show that there exist infinite classes of cubic planar graphs that are not acyclically 3-colorable. Further, we show that every planar graph has a subdivision with one vertex per edge that is acyclically 3-colorable. Finally, we characterize the series-parallel graphs such th作者: Engaged 時間: 2025-3-28 01:23
Reconstruction Algorithm for Permutation Graphsic aspects of the conjecture. We present an . time algorithm for PREIMAGE CONSTRUCTION on permutation graphs, where . is the number of graphs in the input. Since each graph of the input has .???1 vertices and . edges, the input size is .. There are polynomial time isomorphism algorithms for permutat作者: PARA 時間: 2025-3-28 03:37
A Rooted-Forest Partition with Uniform Vertex Demandts no cycle consisting of non-loop edges. In this paper, we shall study on a partition of a graph into edge-disjoint rooted-forests such that each vertex is spanned by exactly . components of the partition, where . is a positive integer.作者: Calculus 時間: 2025-3-28 10:14
Harmonious Coloring on Subclasses of Colinear Graphs harmonious chromatic number is the least integer . for which . admits a harmonious coloring with . colors. Extending previous NP-completeness results of the harmonious coloring problem on subclasses of chordal and co-chordal graphs, we prove that the problem remains NP-complete for split undirected作者: 榮幸 時間: 2025-3-28 11:13 作者: originality 時間: 2025-3-28 15:55
Comparing RNA Structures with Biologically Relevant Operations Cannot Be Done without Strong Combina terms of sequence and structural similarities. Among the many paradigms referring to arc-annotated sequences and RNA structures comparison (see [2] for more details), the most important one is the general edit distance. The problem of computing an edit distance between two non-crossing arc-annotate作者: Inflammation 時間: 2025-3-28 19:00 作者: 不愛防注射 時間: 2025-3-28 23:37
Parallel Algorithms for Encoding and Decoding Blob Codengs and vice versa. For all known bijective codes, optimal sequential encoding and decoding algorithms are presented in literature, while parallel algorithms are investigated only for some of these codes. In this paper we focus our attention on the Blob code: a code particularly considered in the fi作者: Cultivate 時間: 2025-3-29 06:40 作者: 行乞 時間: 2025-3-29 07:28 作者: epidermis 時間: 2025-3-29 12:14 作者: abysmal 時間: 2025-3-29 17:50
Constant-Work-Space Algorithm for a Shortest Path in a Simple Polygon(..) for any positive constant .. Second, we describe how to compute a shortest path between two points in a simple .-gon. Although the shortest path problem in general graphs is NL-complete, this constrained problem can be solved in quadratic time using only constant work space.作者: 注意力集中 時間: 2025-3-29 21:21 作者: LAST 時間: 2025-3-30 03:58
Constant-Work-Space Algorithm for a Shortest Path in a Simple Polygon(..) for any positive constant .. Second, we describe how to compute a shortest path between two points in a simple .-gon. Although the shortest path problem in general graphs is NL-complete, this constrained problem can be solved in quadratic time using only constant work space.作者: Allodynia 時間: 2025-3-30 06:54 作者: paltry 時間: 2025-3-30 10:56 作者: Discrete 時間: 2025-3-30 12:38 作者: 轉(zhuǎn)向 時間: 2025-3-30 19:16 作者: 忘川河 時間: 2025-3-30 22:25
Parallel Algorithms for Encoding and Decoding Blob Codeeld of Genetic Algorithms. To the best of our knowledge, here we present the first parallel encoding and decoding algorithms for this code. The encoding algorithm implementation is optimal on an EREW PRAM, while the decoding algorithm requires .(log.) time and .(.) processors on CREW PRAM.作者: 不容置疑 時間: 2025-3-31 02:29
Reconstruction Algorithm for Permutation Graphsion graphs. However the number of permutation graphs obtained by adding a vertex to a permutation graph is generally exponentially large. Thus exhaustive checking of these graphs does not achieve any polynomial time algorithm. Therefore reducing the number of preimage candidates is the key point.作者: syncope 時間: 2025-3-31 08:46 作者: characteristic 時間: 2025-3-31 11:35 作者: 眉毛 時間: 2025-3-31 14:20
https://doi.org/10.1007/978-3-642-11440-3Approximation; Ban; Graph; algorithms; combinatorial optimization; complexity; computational geometry; opti作者: tenosynovitis 時間: 2025-3-31 21:02 作者: thalamus 時間: 2025-4-1 00:29 作者: 極大的痛苦 時間: 2025-4-1 02:01
Crossings between Curves with Many Tangenciesove every curve in . and that there are . pairs of curves, one from . and the other from ., that are tangent to each other. Then the number of proper crossings among the members of . is at least (1/2???.(1)). ln .. This bound is almost tight.作者: 組裝 時間: 2025-4-1 06:05 作者: AFFIX 時間: 2025-4-1 13:50
A Rooted-Forest Partition with Uniform Vertex Demandts no cycle consisting of non-loop edges. In this paper, we shall study on a partition of a graph into edge-disjoint rooted-forests such that each vertex is spanned by exactly . components of the partition, where . is a positive integer.作者: 胰島素 時間: 2025-4-1 14:58
A Rooted-Forest Partition with Uniform Vertex Demandts no cycle consisting of non-loop edges. In this paper, we shall study on a partition of a graph into edge-disjoint rooted-forests such that each vertex is spanned by exactly . components of the partition, where . is a positive integer.作者: 領(lǐng)先 時間: 2025-4-1 22:21
Approximation Algorithms for Art Gallery Problems in Polygons and TerrainsIn this survey paper, we present an overview of approximation algorithms that are designed for art gallery problems in polygons and terrains.作者: Urea508 時間: 2025-4-2 01:16
Approximation Algorithms for Art Gallery Problems in Polygons and TerrainsIn this survey paper, we present an overview of approximation algorithms that are designed for art gallery problems in polygons and terrains.作者: 智力高 時間: 2025-4-2 05:37 作者: 向外才掩飾 時間: 2025-4-2 08:42
Cutting a Convex Polyhedron Out of a SphereGiven a convex polyhedron . of . vertices inside a sphere ., we give an .(..)-time algorithm that cuts . out of . by using guillotine cuts and has cutting cost .(log..) times the optimal.作者: Melanoma 時間: 2025-4-2 14:39
The 1.375 Approximation Algorithm for Sorting by Transpositions Can Run in ,(,log,) TimeWe improve the running time from .(..) to .(.log.) of the existing best known 1.375?approximation algorithm for sorting by transpositions with the help of the permutation tree data structure.作者: 扔掉掐死你 時間: 2025-4-2 17:52 作者: Canyon 時間: 2025-4-2 20:14
978-3-642-11439-7Springer-Verlag Berlin Heidelberg 2010作者: 偽造 時間: 2025-4-3 02:28 作者: 碎片 時間: 2025-4-3 07:39
0302-9743 Overview: 978-3-642-11439-7978-3-642-11440-3Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: malign 時間: 2025-4-3 11:49
ted to Earth and interplanetary space. These discoveries whetted the curiosity of the inquisitive mind to unravel the causative agents and look for interrelationships between the Earth, the Sun and other planets or satellites and use this knowledge to predictive purposes. Intricacies of changes in t作者: expdient 時間: 2025-4-3 14:16
Jacob Fox,Fabrizio Frati,János Pach,Rom Pinchasital with fractal dimension different from those of other concentration values for the same element, but together the fractal dimensions may form a multifractal spectrum . (.) that is a continuous function of the singularity ., which depends on the concentration value. Self-similar patterns produce m
