標(biāo)題: Titlebook: Algorithms and Computation; 18th International S Takeshi Tokuyama Conference proceedings 2007 Springer-Verlag Berlin Heidelberg 2007 Algori [打印本頁] 作者: Enkephalin 時間: 2025-3-21 16:08
書目名稱Algorithms and Computation影響因子(影響力)
書目名稱Algorithms and Computation影響因子(影響力)學(xué)科排名
書目名稱Algorithms and Computation網(wǎng)絡(luò)公開度
書目名稱Algorithms and Computation網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Algorithms and Computation被引頻次
書目名稱Algorithms and Computation被引頻次學(xué)科排名
書目名稱Algorithms and Computation年度引用
書目名稱Algorithms and Computation年度引用學(xué)科排名
書目名稱Algorithms and Computation讀者反饋
書目名稱Algorithms and Computation讀者反饋學(xué)科排名
作者: 衣服 時間: 2025-3-21 21:35
Coloring Triangle-Free Graphs on Surfaces abstract is to describe a new result along these lines..By a . we mean a compact 2-dimensional manifold with empty boundary. The classification theorem of surfaces states that every surface is homeomorphic to either the surface .. obtained from the sphere by adding . handles (“the orientable surfac作者: 隱藏 時間: 2025-3-22 01:54
Integer Representation and Counting in the Bit Probe Modelcan be performed using few bit inspections and fewer bit changes. In particular, we prove a new lower bound of . for the increment and decrement operation, where . is the minimum number of bits required to represent the number. The model of computation we considered is the bit probe model, where the作者: HEED 時間: 2025-3-22 05:13
Minimum Degree Orderings, and that a minimum cut in a graph can be found by repeatedly contracting a pendent pair, yielding one of the fastest and simplest minimum cut algorithms. In this paper, we provide another ordering of vertices, called a minimum degree ordering (MD ordering) as a new fundamental tool to analyze the 作者: 無聊點好 時間: 2025-3-22 11:40
Greedy Approximation for Source Location Problem with Vertex-Connectivity Requirements in Undirected.., where .. and .. denote the set of nonnegative integers and the set of nonnegative reals, respectively. The source location problem with vertex-connectivity requirements in a given graph . asks to find a set . of vertices minimizing ∑?..(.) such that there are at least .(.) pairwise vertex-disjoi作者: limber 時間: 2025-3-22 12:53 作者: CLOT 時間: 2025-3-22 19:32 作者: 柱廊 時間: 2025-3-23 00:54
Escaping Off-Line Searchers and a Discrete Isoperimetric Theoremtion indefinitely? We study the number of searchers against which the target can still escape. This is less than . in an .×. grid, since a row of searchers can sweep the allowed region..In an alternating move model where at each time first all searchers move and then the target moves, we show that a作者: 反感 時間: 2025-3-23 02:19 作者: 排出 時間: 2025-3-23 06:30 作者: Creditee 時間: 2025-3-23 11:21
Unbounded-Error Classical and Quantum Communication Complexityen studied based on the arrangement of points and hyperplanes. Recently, [14, ICALP’07] found that the unbounded-error . communication complexity in the . model can also be investigated using the arrangement, and showed that it is exactly (without a difference of even one qubit) half of the classica作者: Lineage 時間: 2025-3-23 15:49
A Spectral Method for MAX2SAT in the Planted Solution Modelposed a distribution . for MAX2SAT in the planted solution model, as well as a message-passing algorithm. They showed that it solves, ., MAX2SAT on . for rather dense formulas, i.e., the expected number of clauses is .. In this paper, we propose an algorithm using a spectral method and a variant of 作者: 遠地點 時間: 2025-3-23 19:11
On the Expressive Power of Planar Perfect Matching and Permanents of Bounded Treewidth Matricesof the classical classes P and NP. Prominent examples of difficult (that is, VNP-complete) problems in this model includes the permanent and hamiltonian polynomials. In this paper we investigate the expressive power of easy special cases of these polynomials. We show that the permanent and hamiltoni作者: restrain 時間: 2025-3-23 22:33 作者: 法官 時間: 2025-3-24 05:49 作者: dialect 時間: 2025-3-24 07:26 作者: 幸福愉悅感 時間: 2025-3-24 14:32
Computing Upward Topological Book Embeddings of Upward Planar Digraphs where all edges are monotonically increasing in the upward direction. Besides having its own inherent interest in the theory of upward book embeddability, the question has applications to well studied research topics of computational geometry and of graph drawing. The main results of the paper are 作者: 金哥占卜者 時間: 2025-3-24 18:36
Algorithms for the Hypergraph and the Minor Crossing Number Problemsed before. We present some complexity results regarding the corresponding edge and node insertion problems. Based on these results, we give the first embedding-based heuristics to tackle both problems and present a short experimental study. Furthermore, we give the first exact ILP formulation for bo作者: 鋼盔 時間: 2025-3-24 22:47
On Mixing and Edge Expansion Properties in Randomized BroadcastingInitially, only one vertex of a graph .?=?(.,.) owns a piece of information which is spread iteratively to all other vertices: in each time step .?=?1,2,... every . vertex chooses some neighbor uniformly at random which then becomes informed and may itself inform other vertices in the succeeding tim作者: mitral-valve 時間: 2025-3-25 00:04
Algorithms and Computation978-3-540-77120-3Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: interlude 時間: 2025-3-25 06:06
0302-9743 Overview: 978-3-540-77118-0978-3-540-77120-3Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: allergen 時間: 2025-3-25 08:02 作者: 雕鏤 時間: 2025-3-25 14:37 作者: CLAMP 時間: 2025-3-25 16:30
Computing Upward Topological Book Embeddings of Upward Planar Digraphs where all edges are monotonically increasing in the upward direction. Besides having its own inherent interest in the theory of upward book embeddability, the question has applications to well studied research topics of computational geometry and of graph drawing. The main results of the paper are as follows.作者: 稀釋前 時間: 2025-3-25 22:51
Algorithms for the Hypergraph and the Minor Crossing Number Problemsed before. We present some complexity results regarding the corresponding edge and node insertion problems. Based on these results, we give the first embedding-based heuristics to tackle both problems and present a short experimental study. Furthermore, we give the first exact ILP formulation for both problems.作者: 彈藥 時間: 2025-3-26 03:55 作者: 不溶解 時間: 2025-3-26 04:20
https://doi.org/10.1007/978-3-662-26428-7 abstract is to describe a new result along these lines..By a . we mean a compact 2-dimensional manifold with empty boundary. The classification theorem of surfaces states that every surface is homeomorphic to either the surface .. obtained from the sphere by adding . handles (“the orientable surfac作者: innate 時間: 2025-3-26 11:07 作者: NAG 時間: 2025-3-26 15:52 作者: minaret 時間: 2025-3-26 18:44 作者: fatty-streak 時間: 2025-3-26 23:10 作者: Conjuction 時間: 2025-3-27 04:39
https://doi.org/10.1007/978-3-658-27838-0phs, and 2??structures. We show that, under some axioms, a unique decomposition tree exists for umodules. Polynomial-time algorithms are provided for: non-trivial umodule test, maximal umodule computation, and decomposition tree computation when the tree exists. Our results unify many known decompos作者: SPASM 時間: 2025-3-27 08:07 作者: CBC471 時間: 2025-3-27 12:12
Der Kondensator in der Starkstromtechnikthis paper, we consider a generalization of the classical geometric spanner problem (called segment spanner): Given a set . of disjoint 2-D segments, find a spanning network . with minimum size so that for any pair of points in ., there exists a path in . with length no more than . times their Eucli作者: MELON 時間: 2025-3-27 17:23 作者: lesion 時間: 2025-3-27 21:30
Der Kondensator in Industrieanlagen,en studied based on the arrangement of points and hyperplanes. Recently, [14, ICALP’07] found that the unbounded-error . communication complexity in the . model can also be investigated using the arrangement, and showed that it is exactly (without a difference of even one qubit) half of the classica作者: Defiance 時間: 2025-3-27 23:19
Der Kondensator in Industrieanlagen,posed a distribution . for MAX2SAT in the planted solution model, as well as a message-passing algorithm. They showed that it solves, ., MAX2SAT on . for rather dense formulas, i.e., the expected number of clauses is .. In this paper, we propose an algorithm using a spectral method and a variant of 作者: 半導(dǎo)體 時間: 2025-3-28 05:03
Der Kondensator im Wechselstromkreis,of the classical classes P and NP. Prominent examples of difficult (that is, VNP-complete) problems in this model includes the permanent and hamiltonian polynomials. In this paper we investigate the expressive power of easy special cases of these polynomials. We show that the permanent and hamiltoni作者: 和平主義 時間: 2025-3-28 07:12 作者: 物種起源 時間: 2025-3-28 10:27
Der Kondensator in der Starkstromtechnikme constant approximation algorithm is known for this NP-complete problem. We prove that a natural approach to planar drawing of toroidal graphs (used already by Pach and Tóth in [21]) gives a polynomial time constant approximation algorithm for the crossing number of toroidal graphs with bounded de作者: Commodious 時間: 2025-3-28 17:57 作者: collateral 時間: 2025-3-28 19:23
Fragestellung und Aufbau der Arbeit where all edges are monotonically increasing in the upward direction. Besides having its own inherent interest in the theory of upward book embeddability, the question has applications to well studied research topics of computational geometry and of graph drawing. The main results of the paper are 作者: Inordinate 時間: 2025-3-29 00:21 作者: Inferior 時間: 2025-3-29 05:15
https://doi.org/10.1007/978-3-322-80965-0Initially, only one vertex of a graph .?=?(.,.) owns a piece of information which is spread iteratively to all other vertices: in each time step .?=?1,2,... every . vertex chooses some neighbor uniformly at random which then becomes informed and may itself inform other vertices in the succeeding tim作者: 察覺 時間: 2025-3-29 09:29
https://doi.org/10.1007/978-3-540-77120-3Algorithms; algorithm; complexity; computational geometry; data structure; database; game theory; optimizat作者: exorbitant 時間: 2025-3-29 12:59 作者: Deduct 時間: 2025-3-29 16:04 作者: EXPEL 時間: 2025-3-29 22:41
Die CDU zwischen Pragmatik und Programm, for delivering a max {..?+?1,2..???6}-approximate solution to the problem in . time. Especially, in the case of ..?≤?4, we give a tight analysis to show that it achieves an approximation ratio of 3. We also show the APX-hardness of the problem even restricted to ..?≤?4.作者: 一窩小鳥 時間: 2025-3-30 02:51
Der Kondensator in Industrieanlagen,[BF99], for .?=?2, had obtained the same consequence as of ours in (1) using the stronger hypothesis .. Fortnow, Pavan, and Sengupta [FPS] had obtained the same consequence as of ours in (2) using the stronger hypothesis ...Our results may also be viewed as steps towards obtaining solutions to the m作者: CRACK 時間: 2025-3-30 05:58
https://doi.org/10.1007/978-3-322-80965-0 deriving an upper bound of ., where . denotes the mixing time of a certain random walk on .. After that we give a simple but useful upper bound which is based on a certain average value of the edge expansion of .. Unfortunately, both approaches do not give the right bound for Hypercubes. Therefore,作者: DOSE 時間: 2025-3-30 11:06 作者: 效果 時間: 2025-3-30 12:49 作者: Insensate 時間: 2025-3-30 18:55
On Mixing and Edge Expansion Properties in Randomized Broadcasting deriving an upper bound of ., where . denotes the mixing time of a certain random walk on .. After that we give a simple but useful upper bound which is based on a certain average value of the edge expansion of .. Unfortunately, both approaches do not give the right bound for Hypercubes. Therefore,作者: Frequency-Range 時間: 2025-3-30 22:59
https://doi.org/10.1007/978-3-476-03490-8cause of the scarcity of robust, efficient algorithms for terrain modeling and analysis that can handle massive data sets acquired by different technologies and that can rapidly detect and predict changes in the model as the new data is acquired.作者: 胎兒 時間: 2025-3-31 01:05
https://doi.org/10.1007/978-3-662-26428-7 complexity measure counts only the bitwise accesses to the data structure. We present several efficient data structures to represent integer that use a logarithmic number of bit inspections and a constant number of bit changes per operation.作者: Arroyo 時間: 2025-3-31 06:29 作者: 謊言 時間: 2025-3-31 11:17
Modeling and Analyzing Massive Terrain Data Setscause of the scarcity of robust, efficient algorithms for terrain modeling and analysis that can handle massive data sets acquired by different technologies and that can rapidly detect and predict changes in the model as the new data is acquired.作者: 調(diào)味品 時間: 2025-3-31 13:28
Integer Representation and Counting in the Bit Probe Model complexity measure counts only the bitwise accesses to the data structure. We present several efficient data structures to represent integer that use a logarithmic number of bit inspections and a constant number of bit changes per operation.作者: 膽汁 時間: 2025-3-31 20:06 作者: 冥想后 時間: 2025-3-31 22:04 作者: COMA 時間: 2025-4-1 03:12 作者: 胡言亂語 時間: 2025-4-1 08:39 作者: 投票 時間: 2025-4-1 13:23 作者: Culmination 時間: 2025-4-1 17:53
Der Kondensator im Wechselstromkreis,., providing a positive answer to a conjecture suggested in the literature about whether an upper bound . on the required width can be achieved for an arbitrary plane graph. In fact, our visibility representation achieves optimality in the upper bound of width because the bound differs from the previously known lower bound . only by one unit.
