標題: Titlebook: WALCOM: Algorithms and Computation; Third International Sandip Das,Ryuhei Uehara Conference proceedings 2009 Springer-Verlag Berlin Heidel [打印本頁] 作者: ossicles 時間: 2025-3-21 17:10
書目名稱WALCOM: Algorithms and Computation影響因子(影響力)
書目名稱WALCOM: Algorithms and Computation影響因子(影響力)學科排名
書目名稱WALCOM: Algorithms and Computation網絡公開度
書目名稱WALCOM: Algorithms and Computation網絡公開度學科排名
書目名稱WALCOM: Algorithms and Computation被引頻次
書目名稱WALCOM: Algorithms and Computation被引頻次學科排名
書目名稱WALCOM: Algorithms and Computation年度引用
書目名稱WALCOM: Algorithms and Computation年度引用學科排名
書目名稱WALCOM: Algorithms and Computation讀者反饋
書目名稱WALCOM: Algorithms and Computation讀者反饋學科排名
作者: VOC 時間: 2025-3-21 23:56
Algorithms for Computing Diffuse Reflection Paths in Polygonsreflections in the path produced by this algorithm can be at most 3 times that of an optimal diffuse reflection path. The problem of computing a diffuse reflection path between two points inside a polygon has not been considered in the past.作者: 狂熱語言 時間: 2025-3-22 00:59
Algorithms for Computing Diffuse Reflection Paths in Polygonsreflections in the path produced by this algorithm can be at most 3 times that of an optimal diffuse reflection path. The problem of computing a diffuse reflection path between two points inside a polygon has not been considered in the past.作者: Melanocytes 時間: 2025-3-22 06:34 作者: incredulity 時間: 2025-3-22 08:45
Minmax Tree Cover in the Euclidean Spaceonal Euclidean space ?., and break the bound 2 on ., showing that . for .?≥?3 and . for .?=?2. These new results enable us to directly improve the performance guarantees of several existing approximation algorithms for graph partitioning problems if the metric space is an Euclidean space.作者: 有說服力 時間: 2025-3-22 15:30
On Exact Solutions to the Euclidean Bottleneck Steiner Tree Problemoints, we present an .(. log.) time exact algorithm for .?=?1 and an .(..) time algorithm for .?=?2. Also, we present an .(. log.) time exact algorithm to the problem for a special case where there is no edge between Steiner points.作者: Hla461 時間: 2025-3-22 20:39 作者: expansive 時間: 2025-3-23 00:17
0302-9743 ms. The papers are organized in topical sections on computational geometry, graph algorithms, complexity, graph drawing, approximation algorithms, and randomized algorithms.978-3-642-00201-4978-3-642-00202-1Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 完整 時間: 2025-3-23 03:44 作者: Monocle 時間: 2025-3-23 07:46
Colinear Coloring on Graphsa vertex . is the set of all maximal cliques containing .); the colinear chromatic number .(.) of . is the least integer . for which . admits a colinear coloring with . colors. Based on the colinear coloring, we define the .-colinear and .-colinear properties and characterize known graph classes in terms of these properties.作者: Colonnade 時間: 2025-3-23 10:59 作者: 植物學 時間: 2025-3-23 16:29 作者: metropolitan 時間: 2025-3-23 18:48 作者: 沉思的魚 時間: 2025-3-24 01:48
Foundations of Exact Roundingor exact rounding. We show that all the elementary functions in ISO standard (ISO/IEC 10967) for Language Independent Arithmetic can be exactly rounded, in any format, and to any precision. Moreover, a priori complexity bounds can be given for these rounding problems. Our conclusions are derived fro作者: 割讓 時間: 2025-3-24 05:30 作者: Collar 時間: 2025-3-24 07:49
Approximating Shortest Paths in Graphslem of weighted directed graphs. In contrast, there has been a growing interest in the area of algorithms for approximate shortest paths leading to many interesting variations of the original problem..In this article, we trace some of the fundamental developments like spanners and distance oracles, 作者: 序曲 時間: 2025-3-24 13:56 作者: Engulf 時間: 2025-3-24 15:42
Algorithms for Computing Diffuse Reflection Paths in Polygonss of the path lie on polygonal edges of .. We present three different algorithms for computing diffuse reflection paths from . to . inside .. For constructing such a path, the first algorithm uses a greedy method, the second algorithm uses a transformation of a minimum link path, and the third algor作者: CRAMP 時間: 2025-3-24 20:29 作者: gusher 時間: 2025-3-25 01:50
Shortest Gently Descending Pathsgeneralization of the shortest descending path problem, called the . problem, where a path descends, but not too steeply. The additional constraint to disallow a very steep descent makes the paths more realistic in practice. We give two approximation algorithms (more precisely, FPTASs) to solve the 作者: 使入迷 時間: 2025-3-25 06:45 作者: Arable 時間: 2025-3-25 07:38 作者: GLOSS 時間: 2025-3-25 15:36 作者: JEER 時間: 2025-3-25 18:26 作者: Guileless 時間: 2025-3-25 20:48 作者: granite 時間: 2025-3-26 03:44
Maximum Neighbour Voronoi Games . points with the target of maximizing total Voronoi area of its sites in the Voronoi diagram of 2. points. In this paper we address this problem by introducing Voronoi games . where the basic objective of an optimal playing strategy is to acquire more neighbors than the opponent. We consider sever作者: Foreknowledge 時間: 2025-3-26 05:39 作者: Nefarious 時間: 2025-3-26 12:01
On Exact Solutions to the Euclidean Bottleneck Steiner Tree Problemt most . Steiner points such that the length of the longest edge in the tree is minimized. This problem is known to be NP-hard even to approximate within ratio .. We focus on finding exact solutions to the problem for a small constant .. Based on geometric properties of optimal location of Steiner p作者: 滔滔不絕地說 時間: 2025-3-26 14:48
Colinear Coloring on Graphsrough which it was studied, we introduce the colinear coloring on graphs. We provide an upper bound for the chromatic number .(.), for any graph ., and show that . can be colinearly colored in polynomial time by proposing a simple algorithm. The colinear coloring of a graph . is a vertex coloring su作者: indemnify 時間: 2025-3-26 20:30
Colinear Coloring on Graphsrough which it was studied, we introduce the colinear coloring on graphs. We provide an upper bound for the chromatic number .(.), for any graph ., and show that . can be colinearly colored in polynomial time by proposing a simple algorithm. The colinear coloring of a graph . is a vertex coloring su作者: A保存的 時間: 2025-3-26 23:47
Recursive Generation of 5-Regular Planar Graphspplying a few local expansion operations. The proof uses an innovative amalgam of theory and computation. By incorporating the recursion into the canonical construction path method of isomorph rejection, a generator of non-isomorphic embedded 5-regular planar graphs is obtained with time complexity 作者: 擦試不掉 時間: 2025-3-27 04:56 作者: vitrectomy 時間: 2025-3-27 07:34 作者: oblique 時間: 2025-3-27 12:26
Generating All Triangulations of Plane Graphs (Extended Abstract)triconnected plane graph . of . vertices. Our algorithm establishes a tree structure among the triangulations of ., called the “tree of triangulations,” and generates each triangulation of . in .(1) time. The algorithm uses .(.) space and generates all triangulations of . without duplications. To th作者: 泥沼 時間: 2025-3-27 16:44
Recognition of Unigraphs through Superposition of Graphs (Extended Abstract)duced: vertex set is partitioned into three disjoint sets while edge set is divided into two different classes. This characterization allows us to design a linear time recognition algorithm that works recursively pruning the degree sequence of the graph. The algorithm detects two particular graphs w作者: 脊椎動物 時間: 2025-3-27 21:13
Recognition of Unigraphs through Superposition of Graphs (Extended Abstract)duced: vertex set is partitioned into three disjoint sets while edge set is divided into two different classes. This characterization allows us to design a linear time recognition algorithm that works recursively pruning the degree sequence of the graph. The algorithm detects two particular graphs w作者: employor 時間: 2025-3-28 01:42
Random Generation and Enumeration of Proper Interval Graphsng it, a simple algorithm that generates a connected proper interval graph uniformly at random up to isomorphism is presented. Finally an enumeration algorithm of connected proper interval graphs is proposed. The algorithm is based on the reverse search, and it outputs each connected proper interval作者: Parallel 時間: 2025-3-28 05:20 作者: 他去就結束 時間: 2025-3-28 07:53 作者: 詼諧 時間: 2025-3-28 14:01 作者: 遠足 時間: 2025-3-28 16:17
Minmax Tree Cover in the Euclidean Space balanced tree partitioning problem requires to cover all vertices in . by a set . of . trees of the graph so that the ratio . of . to .(..)/. is minimized, where .. denotes a minimum spanning tree of .. The problem has been used as a core analysis in designing approximation algorithms for several t作者: 面包屑 時間: 2025-3-28 21:39 作者: cushion 時間: 2025-3-29 02:05 作者: 骨 時間: 2025-3-29 04:50
A Separator Theorem for String Graphs and Its Applications bipartite subgraph .. has at most ... edges, where .. is a constant depending only on .. Another application is that, for any .?>?0, there is an integer .(.) such that every string graph with . vertices and girth at least .(.) has at most (1?+?.). edges.作者: 減少 時間: 2025-3-29 08:22 作者: 失眠癥 時間: 2025-3-29 11:50 作者: inhumane 時間: 2025-3-29 16:03
Approximating Shortest Paths in Graphsny interesting variations of the original problem..In this article, we trace some of the fundamental developments like spanners and distance oracles, their underlying constructions, as well as their applications to the approximate all-pairs shortest paths.作者: Spinal-Tap 時間: 2025-3-29 22:00 作者: 連詞 時間: 2025-3-30 02:42 作者: 公理 時間: 2025-3-30 04:57 作者: magnate 時間: 2025-3-30 11:53 作者: Precursor 時間: 2025-3-30 13:51
Network Design with Weighted Degree Constraintsto compute a minimum cost graph with a prescribed connectivity. We propose bi-criteria approximation algorithms based on the iterative rounding, which has been successfully applied to the degree-bounded network design problem. A problem minimizing the maximum weighted degree of vertices is also discussed.作者: LUDE 時間: 2025-3-30 18:32
Network Design with Weighted Degree Constraintsto compute a minimum cost graph with a prescribed connectivity. We propose bi-criteria approximation algorithms based on the iterative rounding, which has been successfully applied to the degree-bounded network design problem. A problem minimizing the maximum weighted degree of vertices is also discussed.作者: 休閑 時間: 2025-3-30 23:30
Conference proceedings 2009papers feature original research in the areas of design and analysis of algorithms, computational geometry, graph drawing and graph algorithms. The papers are organized in topical sections on computational geometry, graph algorithms, complexity, graph drawing, approximation algorithms, and randomized algorithms.作者: Ballad 時間: 2025-3-31 04:02
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/w/image/1020034.jpg作者: hypertension 時間: 2025-3-31 06:29 作者: 手銬 時間: 2025-3-31 10:24 作者: 永久 時間: 2025-3-31 16:28 作者: 軍火 時間: 2025-3-31 18:56
Foundations of Exact Roundingor exact rounding. We show that all the elementary functions in ISO standard (ISO/IEC 10967) for Language Independent Arithmetic can be exactly rounded, in any format, and to any precision. Moreover, a priori complexity bounds can be given for these rounding problems. Our conclusions are derived from results in transcendental number theory.作者: Pelvic-Floor 時間: 2025-3-31 22:07
Foundations of Exact Roundingor exact rounding. We show that all the elementary functions in ISO standard (ISO/IEC 10967) for Language Independent Arithmetic can be exactly rounded, in any format, and to any precision. Moreover, a priori complexity bounds can be given for these rounding problems. Our conclusions are derived from results in transcendental number theory.作者: 對待 時間: 2025-4-1 03:30 作者: Hemoptysis 時間: 2025-4-1 05:59
Shortest Gently Descending Pathsgeneralization of the shortest descending path problem, called the . problem, where a path descends, but not too steeply. The additional constraint to disallow a very steep descent makes the paths more realistic in practice. We give two approximation algorithms (more precisely, FPTASs) to solve the SGDP problem on general terrains.作者: exhibit 時間: 2025-4-1 13:11
Improved Algorithm for a Widest 1-Corner Corridor link is an unbounded trapezium bounded by two parallel half-lines, and it does not contain any point of .. We present an improved algorithm for computing the widest empty 1-corner corridor that runs in .(..log..) time and .(..) space. This improves the time complexity of the best known algorithm for the same problem by a factor of .[4].作者: 郊外 時間: 2025-4-1 15:06 作者: 嗎啡 時間: 2025-4-1 21:27 作者: 微生物 時間: 2025-4-2 00:23 作者: stroke 時間: 2025-4-2 06:24 作者: 多樣 時間: 2025-4-2 08:04
Recognition of Unigraphs through Superposition of Graphs (Extended Abstract)duced: vertex set is partitioned into three disjoint sets while edge set is divided into two different classes. This characterization allows us to design a linear time recognition algorithm that works recursively pruning the degree sequence of the graph. The algorithm detects two particular graphs whose superposition generates the given unigraph.作者: 生來 時間: 2025-4-2 11:30
Random Generation and Enumeration of Proper Interval Graphsng it, a simple algorithm that generates a connected proper interval graph uniformly at random up to isomorphism is presented. Finally an enumeration algorithm of connected proper interval graphs is proposed. The algorithm is based on the reverse search, and it outputs each connected proper interval graph in . time.作者: 凹處 時間: 2025-4-2 17:06 作者: 勾引 時間: 2025-4-2 20:24
Line Transversals and Pinning NumbersA . to a family of convex objects in ?. is a line intersecting each member of the family. There is a rich theory of geometric transversals, see for instance the surveys of Danzer et al. [6], Eckhoff [7], Goodman et al. [8] and Wenger [11].作者: 背信 時間: 2025-4-3 02:49 作者: 有說服力 時間: 2025-4-3 06:17
Efficient Enumeration of Ordered Trees with , Leaves (Extended Abstract)In this paper, we give a simple algorithm to generate all ordered trees with exactly . vertices including exactly . leaves. The best known algorithm generates such trees in .(.???.) time for each, while our algorithm generates such trees in .(1) time for each in worst case.作者: coddle 時間: 2025-4-3 08:24
Efficient Enumeration of Ordered Trees with , Leaves (Extended Abstract)In this paper, we give a simple algorithm to generate all ordered trees with exactly . vertices including exactly . leaves. The best known algorithm generates such trees in .(.???.) time for each, while our algorithm generates such trees in .(1) time for each in worst case.作者: 冰河期 時間: 2025-4-3 13:42
A Fully Dynamic Graph Algorithm for Recognizing Proper Interval GraphsWe present a fully dynamic graph algorithm to recognize proper interval graphs that runs in .(log.) worst case time per edge update, where . is the number of vertices in the graph. The algorithm also maintains the connected components and supports connectivity queries in .(log.) time.
