標(biāo)題: Titlebook: Computing and Combinatorics; 15th Annual Internat Hung Q. Ngo Conference proceedings 2009 Springer-Verlag Berlin Heidelberg 2009 Graph.algo [打印本頁] 作者: STH 時(shí)間: 2025-3-21 17:37
書目名稱Computing and Combinatorics影響因子(影響力)
書目名稱Computing and Combinatorics影響因子(影響力)學(xué)科排名
書目名稱Computing and Combinatorics網(wǎng)絡(luò)公開度
書目名稱Computing and Combinatorics網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Computing and Combinatorics被引頻次
書目名稱Computing and Combinatorics被引頻次學(xué)科排名
書目名稱Computing and Combinatorics年度引用
書目名稱Computing and Combinatorics年度引用學(xué)科排名
書目名稱Computing and Combinatorics讀者反饋
書目名稱Computing and Combinatorics讀者反饋學(xué)科排名
作者: liaison 時(shí)間: 2025-3-21 22:39
On the Performances of Nash Equilibria in Isolation Gamesin which the existence of Nash equilibria has been shown, we give tight or asymptotically tight bounds on the prices of anarchy and stability under the two classical social functions mostly investigated in the scientific literature, namely, the minimum utility per player and the sum of the players’ 作者: Dna262 時(shí)間: 2025-3-22 00:24 作者: 相互影響 時(shí)間: 2025-3-22 06:02 作者: 心神不寧 時(shí)間: 2025-3-22 10:47
A (4,???4)-Bit Representation of a Rectangular Drawing or Floorplanand Nakano published a (5.???5)-bit representation of a rectangular drawing, where . is the number of inner rectangles. In this paper, a (4.???4)-bit representation of rectangular drawing is introduced. Moreover, this representation gives an alternative proof that the number of rectangles with . rec作者: 我沒有強(qiáng)迫 時(shí)間: 2025-3-22 16:05 作者: 我沒有強(qiáng)迫 時(shí)間: 2025-3-22 20:42
Coordinate Assignment for Cyclic Level Graphsses: cycle removal, leveling, crossing reduction, and coordinate assignment. However, there are situations where cycles must be displayed as such, e. g., distinguished cycles in the biosciences and scheduling processes which repeat in a daily or weekly turn. This excludes the removal of cycles. In t作者: 藝術(shù) 時(shí)間: 2025-3-22 21:18
Crossing-Optimal Acyclic HP-Completion for Outerplanar ,-Digraphssmallest possible number of edge crossings and turn . to a hamiltonian acyclic digraph. In this paper, we present a linear time algorithm which solves the Acyclic-HPCCM problem on any outerplanar .-digraph .. The algorithm is based on properties of the optimal solution and an ... As a consequence of作者: 社團(tuán) 時(shí)間: 2025-3-23 02:52 作者: motivate 時(shí)間: 2025-3-23 07:46
Efficient Data Structures for the Orthogonal Range Successor Problems that lie on an . ×. grid. Then, for any given rectangle ., our target is to report, among all points of .?∩?., the point which has the smallest .-coordinate. We propose two indexing data structures for . so that online orthogonal range successor queries are supported efficiently. The first one is 作者: 口音在加重 時(shí)間: 2025-3-23 10:19 作者: ASSAY 時(shí)間: 2025-3-23 14:17 作者: 吃掉 時(shí)間: 2025-3-23 21:30
Minimal Assumptions and Round Complexity for Concurrent Zero-Knowledge in the Bare Public-Key Model) model of [3], which are sound (i.e., a cheating prover cannot prove that .) and (black-box) zero-knowledge (i.e., a cheating verifier does not obtain any additional information other than .?∈?.) even in the presence of concurrent attacks (i.e., even if the cheating prover or verifier are allowed t作者: GRAVE 時(shí)間: 2025-3-23 23:16 作者: 物種起源 時(shí)間: 2025-3-24 03:50 作者: Collected 時(shí)間: 2025-3-24 08:50 作者: Small-Intestine 時(shí)間: 2025-3-24 11:49
On an Online Traveling Repairman Problem with Flowtimes: Worst-Case and Average-Case Analysis time. Each request requires one unit of servicetime. The server is free to choose the ordering of service and intends to minimize the total flowtime of the requests..A natural class of algorithms for this problem are . algorithms. From worst-case perspective we show that . algorithms are not compet作者: cauda-equina 時(shí)間: 2025-3-24 17:24
Three New Algorithms for Regular Language Enumeration. accepted by a given NFA, the . is to list all words of length . accepted by an NFA in lexicographical order, and the . is to list the first . words accepted by an NFA according to length-lexicographic order. For the min-word and cross-section problems, we present algorithms with better asymptotic 作者: Dri727 時(shí)間: 2025-3-24 20:14 作者: 保守黨 時(shí)間: 2025-3-25 03:07
978-3-642-02881-6Springer-Verlag Berlin Heidelberg 2009作者: Constant 時(shí)間: 2025-3-25 04:59
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/c/image/234770.jpg作者: Ringworm 時(shí)間: 2025-3-25 11:12 作者: 語源學(xué) 時(shí)間: 2025-3-25 13:42 作者: 數(shù)量 時(shí)間: 2025-3-25 17:28 作者: Host142 時(shí)間: 2025-3-25 23:43 作者: 6Applepolish 時(shí)間: 2025-3-26 03:32 作者: Aphorism 時(shí)間: 2025-3-26 04:27 作者: 群島 時(shí)間: 2025-3-26 12:25
Springer Series in Chemical Physicsntropy function) with high probability is a (.,1/.)-list decodable code. (That is, every Hamming ball of radius at most . has at most 1/. codewords in it.) In this paper we prove the “converse” result. In particular, we prove that for . 0?
作者: AVOW 時(shí)間: 2025-3-26 16:01 作者: 北京人起源 時(shí)間: 2025-3-26 16:54
https://doi.org/10.1007/978-3-540-74555-6and Nakano published a (5.???5)-bit representation of a rectangular drawing, where . is the number of inner rectangles. In this paper, a (4.???4)-bit representation of rectangular drawing is introduced. Moreover, this representation gives an alternative proof that the number of rectangles with . rec作者: 使激動(dòng) 時(shí)間: 2025-3-26 22:15
Fluctuation–Dissipation Relationse union of the edge sets assigned to . and . contains a path from . to .. . (MCD) is defined as one to find an assignment that minimizes the sum of the cardinality of the edge set assigned to each node. In this paper, we give an advanced investigation about the difficulty of MCD by focusing on the r作者: disciplined 時(shí)間: 2025-3-27 01:09 作者: 冒號(hào) 時(shí)間: 2025-3-27 06:43 作者: acrobat 時(shí)間: 2025-3-27 09:36
The Solubility of Calcite in Sea Water,aph exist whenever two grid paths share a grid edge. This type of graphs is motivated by applications in conflict resolution of paths in grid networks..In this paper, we continue the study of edge-intersection graphs of paths in a grid, which was initiated by Golumbic, Lipshteyn and Stern. We show t作者: Introduction 時(shí)間: 2025-3-27 16:50
Geothermometry and geobarometry,s that lie on an . ×. grid. Then, for any given rectangle ., our target is to report, among all points of .?∩?., the point which has the smallest .-coordinate. We propose two indexing data structures for . so that online orthogonal range successor queries are supported efficiently. The first one is 作者: 我不怕犧牲 時(shí)間: 2025-3-27 20:36 作者: 情感 時(shí)間: 2025-3-28 01:33 作者: Lipoprotein 時(shí)間: 2025-3-28 03:50
Thermodynamics in Mineral Sciences) model of [3], which are sound (i.e., a cheating prover cannot prove that .) and (black-box) zero-knowledge (i.e., a cheating verifier does not obtain any additional information other than .?∈?.) even in the presence of concurrent attacks (i.e., even if the cheating prover or verifier are allowed t作者: 兩種語言 時(shí)間: 2025-3-28 08:54
Geothermometry and geobarometry,not rely on the random oracle assumption. The proof consists of a constant number of group elements. Compared with the most efficient constant-size range proof available in the literature, our scheme has significantly reduced the proof size. We showed that our scheme achieves perfect completeness, p作者: 火花 時(shí)間: 2025-3-28 14:01 作者: 偽善 時(shí)間: 2025-3-28 15:07
Thermodynamics in Mineral Scienceskselect – is an easy-to-implement algorithm for finding the .-th smallest element of a sequence. While the worst-case number of comparisons that Hoare’s find needs is Θ(..), the average-case number is Θ(.). We analyze what happens between these two extremes by providing a smoothed analysis of the al作者: 不開心 時(shí)間: 2025-3-28 21:08 作者: 煞費(fèi)苦心 時(shí)間: 2025-3-29 01:36
H. Farkas,I. Faragó,P. L. Simon. accepted by a given NFA, the . is to list all words of length . accepted by an NFA in lexicographical order, and the . is to list the first . words accepted by an NFA according to length-lexicographic order. For the min-word and cross-section problems, we present algorithms with better asymptotic 作者: photopsia 時(shí)間: 2025-3-29 04:15
Fluctuations in Limit Cycle OscillatorsIn Internet advertising, a configuration of ads is determined by the seller, and advertisers buy spaces in the configuration. In this paper, motivated by sponsored search ads, we propose an auction where advertisers directly bid and determine the eventual configuration.作者: Acetaminophen 時(shí)間: 2025-3-29 07:14 作者: Juvenile 時(shí)間: 2025-3-29 14:52
On the Performances of Nash Equilibria in Isolation Gamese two classical social functions mostly investigated in the scientific literature, namely, the minimum utility per player and the sum of the players’ utilities. Moreover, we prove that the convergence to Nash equilibria is not guaranteed in some of the not yet analyzed cases.作者: 追逐 時(shí)間: 2025-3-29 17:34 作者: 發(fā)生 時(shí)間: 2025-3-29 23:41 作者: degradation 時(shí)間: 2025-3-30 02:22 作者: ALT 時(shí)間: 2025-3-30 04:26
A Fast Algorithm for Computing a Nearly Equitable Edge Coloring with Balanced Conditionsed in each color class, where conditions are imposed on the balance among all edges in the multigraph as well as the balance among parallel edges between each vertex pair. None of the previous algorithms are guaranteed to satisfy these balanced conditions simultaneously.作者: 織布機(jī) 時(shí)間: 2025-3-30 11:22
Efficient Non-interactive Range Proofnge proof available in the literature, our scheme has significantly reduced the proof size. We showed that our scheme achieves perfect completeness, perfect soundness and composable zero-knowledge under a conventional number-theoretic assumption, namely the Subgroup Decision Problem.作者: nitroglycerin 時(shí)間: 2025-3-30 16:11
Three New Algorithms for Regular Language Enumerationaccepted by an NFA according to length-lexicographic order. For the min-word and cross-section problems, we present algorithms with better asymptotic running times than previously known algorithms. Additionally, for each problem, we present algorithms with better practical running times than previously known algorithms.作者: 擴(kuò)大 時(shí)間: 2025-3-30 18:06
Fluctuations in Limit Cycle Oscillatorse two classical social functions mostly investigated in the scientific literature, namely, the minimum utility per player and the sum of the players’ utilities. Moreover, we prove that the convergence to Nash equilibria is not guaranteed in some of the not yet analyzed cases.作者: 潰爛 時(shí)間: 2025-3-30 23:10 作者: 跳動(dòng) 時(shí)間: 2025-3-31 01:11 作者: Gratulate 時(shí)間: 2025-3-31 06:34 作者: TATE 時(shí)間: 2025-3-31 12:46
Gibbs free energy and Helmholtz free energy,ed in each color class, where conditions are imposed on the balance among all edges in the multigraph as well as the balance among parallel edges between each vertex pair. None of the previous algorithms are guaranteed to satisfy these balanced conditions simultaneously.作者: semble 時(shí)間: 2025-3-31 14:50 作者: FUSE 時(shí)間: 2025-3-31 18:36
H. Farkas,I. Faragó,P. L. Simonaccepted by an NFA according to length-lexicographic order. For the min-word and cross-section problems, we present algorithms with better asymptotic running times than previously known algorithms. Additionally, for each problem, we present algorithms with better practical running times than previously known algorithms.作者: Gullible 時(shí)間: 2025-3-31 22:16 作者: 楓樹 時(shí)間: 2025-4-1 05:05 作者: 顯微鏡 時(shí)間: 2025-4-1 06:30 作者: Mangle 時(shí)間: 2025-4-1 11:14 作者: 整頓 時(shí)間: 2025-4-1 16:39
Coordinate Assignment for Cyclic Level Graphsch attention in the following years. In this paper we supplement our cyclic Sugiyama framework and investigate the coordinate assignment phase. We provide an algorithm which runs in linear time and constructs drawings which have at most two bends per edge and use quadratic area.
