作者: FEMUR 時間: 2025-3-21 20:54 作者: 標準 時間: 2025-3-22 00:39 作者: 手勢 時間: 2025-3-22 05:06
On Improved Exact Algorithms for ,(2,1)-Labeling of Graphs,In this paper we present an algorithm for finding an optimal .(2,1)-labeling (i.e. an .(2,1)-labeling in which largest label is the least possible) of a graph with time complexity .. ( 3.5616 .), which improves a previous best result: .. ( 3.8739 .).作者: 驚呼 時間: 2025-3-22 09:42 作者: 鑒賞家 時間: 2025-3-22 13:12 作者: 鑒賞家 時間: 2025-3-22 19:00 作者: 不成比例 時間: 2025-3-22 21:56 作者: 有偏見 時間: 2025-3-23 04:39 作者: ATOPY 時間: 2025-3-23 06:34 作者: sphincter 時間: 2025-3-23 13:24 作者: 討人喜歡 時間: 2025-3-23 13:52
Single Parameter FPT-Algorithms for Non-trivial Games, this paper provides positive results regarding Nash equilibria. We show that consideration of sparse games or limitations of the support result in fixed-parameter algorithms with respect to one parameter only for the .. problem. That is, we show that a sample uniform Nash equilibrium in .-sparse im作者: atopic 時間: 2025-3-23 18:13
The Complexity Status of Problems Related to Sparsest Cuts,(.)/(|.||.???.|). This problem is NP-hard. The proof can be found in [16]. In the case of unit capacities (i. e. if .(.)?=?1 for every .?∈?.) the problem is to minimize |.(.,.???.)|/(|.||.???.|) over all subsets .???.. While this variant of the sparsest cut problem is often assumed to be NP-hard, th作者: Fraudulent 時間: 2025-3-23 22:23
On Approximation Complexity of Metric Dimension Problem,imension problem is not approximable within . for any ., unless ., and we give an approximation algorithm which matches the lower bound. Even for bounded degree instances it is APX-hard to determine (compute) the exact value of the metric dimension which we prove by constructing an approximation pre作者: 支柱 時間: 2025-3-24 02:53 作者: cathartic 時間: 2025-3-24 08:54 作者: 大門在匯總 時間: 2025-3-24 14:05
Computing Role Assignments of Proper Interval Graphs in Polynomial Time,morphism is also called an .-role assignment of .. Role assignments have applications in distributed computing, social network theory, and topological graph theory. The . problem has as input a pair of graphs (.,.) and asks whether . has an .-role assignment. This problem is .-complete already on in作者: 妨礙 時間: 2025-3-24 16:21 作者: Incommensurate 時間: 2025-3-24 21:19 作者: Flounder 時間: 2025-3-25 01:40 作者: V切開 時間: 2025-3-25 05:24
Simon Gray: Numbness of the Heart,In this paper we present an algorithm for finding an optimal .(2,1)-labeling (i.e. an .(2,1)-labeling in which largest label is the least possible) of a graph with time complexity .. ( 3.5616 .), which improves a previous best result: .. ( 3.8739 .).作者: 規(guī)范要多 時間: 2025-3-25 10:28 作者: 六個才偏離 時間: 2025-3-25 14:16 作者: 誘使 時間: 2025-3-25 19:37 作者: ARIA 時間: 2025-3-25 22:39 作者: 頭腦冷靜 時間: 2025-3-26 01:32
https://doi.org/10.1007/978-3-642-19222-7combinatorial enumeration; computational complexity; graph coloring; graph labeling; hypergraphs; matrix 作者: Dislocation 時間: 2025-3-26 04:18
978-3-642-19221-0Springer Berlin Heidelberg 2011作者: Medley 時間: 2025-3-26 10:42 作者: 核心 時間: 2025-3-26 13:46 作者: 小樣他閑聊 時間: 2025-3-26 20:05 作者: 窒息 時間: 2025-3-27 00:42
Howard Brenton: Romantic Retreats, defined as |.|/. and is ≥?2. We show new bounds on the maximal sum of exponents of runs in a string of length .. Our upper bound of 4.1 . is better than the best previously known proven bound of 5.6 . by Crochemore & Ilie (2008). The lower bound of 2.035 ., obtained using a family of binary words, 作者: irreducible 時間: 2025-3-27 01:30 作者: Ophthalmologist 時間: 2025-3-27 08:04 作者: convert 時間: 2025-3-27 12:43 作者: ELUC 時間: 2025-3-27 15:44 作者: 不舒服 時間: 2025-3-27 20:11 作者: ABASH 時間: 2025-3-28 01:12 作者: 羞辱 時間: 2025-3-28 06:10
Why Do Crises Occur? Causal Theories,In the first problem, we have a pattern . of length . over an alphabet of size ., and given any text . of length ., where each character is encoded using log. bit, we wish to find all occurrences of .. For the multi-pattern matching problem we have a set . of . patterns of total length . and a query作者: BORE 時間: 2025-3-28 08:09
https://doi.org/10.1007/978-1-4899-2100-0uch that |.(.)???.(.)|?≥?2 if . is a vertex and . is an edge incident to ., and |.(.)???.(.)|?≥?1 if . and . are a pair of adjacent vertices or a pair of adjacent edges, for all . and . in .(.)?∪?.(.). The (2,1)-total labeling number . of . is defined as the minimum . among all possible assignments.作者: AGATE 時間: 2025-3-28 10:58
https://doi.org/10.1007/978-1-4899-2100-0imize I/O traffic to slower memories in the hierarchy. In this paper, we present I/O efficient algorithms to pebble .-pyramids and derive lower bounds on the number of I/O steps to do so. The .-pyramid graph models financial applications which are of practical interest and where minimizing memory tr作者: averse 時間: 2025-3-28 17:26
Cohomological Degrees of Graded Modules, this paper provides positive results regarding Nash equilibria. We show that consideration of sparse games or limitations of the support result in fixed-parameter algorithms with respect to one parameter only for the .. problem. That is, we show that a sample uniform Nash equilibrium in .-sparse im作者: 柔美流暢 時間: 2025-3-28 19:09 作者: Arable 時間: 2025-3-29 02:39
Method and taste in natural philosophy,imension problem is not approximable within . for any ., unless ., and we give an approximation algorithm which matches the lower bound. Even for bounded degree instances it is APX-hard to determine (compute) the exact value of the metric dimension which we prove by constructing an approximation pre作者: 使苦惱 時間: 2025-3-29 03:18
Six Lectures on Modern Natural Philosophye the map of interesting areas. Based on existing approaches, we start our study from the standard random deployment of a sensor network and then we consider a coarse-grain localization algorithm which associates sensors with coordinates related to a central node, called .. Once each sensor is relat作者: 某人 時間: 2025-3-29 10:43
https://doi.org/10.1007/978-94-017-3006-8se removal results in the greatest decrease in the maximum weight of independent sets. We also consider the complementary problem, minimum node blocker independent set that consists of removing a subset of vertices of minimum size such that the maximum weight of independent sets in the remaining gra作者: TEM 時間: 2025-3-29 12:22 作者: 反應(yīng) 時間: 2025-3-29 18:20
The Influence of the Holocaust,ent with them. Is there an algorithm, whose running time may be bounded by a polynomial function of |.| and log|.(.)|, which decides whether .???. is still connected? Even though the answer to this question is negative in general, we describe an algorithm which resolves this problem for the .-dimens作者: 晚來的提名 時間: 2025-3-29 21:41
0302-9743 e 21st International Workshop on Combinatorial Algorithms, IWOCA 2010, held in London, UK, in July 2010. .The 31 revised full papers presented together with extended abstracts of 8 poster presentations were carefully reviewed and selected from a total of 85 submissions. A broad variety of combinator作者: 規(guī)章 時間: 2025-3-30 03:05 作者: ABOUT 時間: 2025-3-30 04:02 作者: Accessible 時間: 2025-3-30 09:30 作者: Obligatory 時間: 2025-3-30 13:18
Six Lectures on Commutative Algebralem is to minimize |.(.,.???.)|/(|.||.???.|) over all subsets .???.. While this variant of the sparsest cut problem is often assumed to be NP-hard, this note contains the first proof of this fact. We also prove that the problem is polynomially solvable for graphs of bounded treewidth.作者: OGLE 時間: 2025-3-30 19:30 作者: 暴露他抗議 時間: 2025-3-30 22:05
Parameterized Algorithms for the Independent Set Problem in Some Hereditary Graph Classes, problem in restricted graph classes. In the present paper, we analyse two techniques that have previously been used to solve the problem in polynomial time for graphs in particular classes and apply these techniques to develop fpt-algorithms for graphs in some classes where the problem remains NP-complete.作者: 星星 時間: 2025-3-31 00:54 作者: Goblet-Cells 時間: 2025-3-31 05:45
Upper and Lower I/O Bounds for Pebbling ,-Pyramids, on the number of I/O steps to do so. The .-pyramid graph models financial applications which are of practical interest and where minimizing memory traffic can have a significant impact on cost saving.作者: Ingratiate 時間: 2025-3-31 11:20
The Complexity Status of Problems Related to Sparsest Cuts,lem is to minimize |.(.,.???.)|/(|.||.???.|) over all subsets .???.. While this variant of the sparsest cut problem is often assumed to be NP-hard, this note contains the first proof of this fact. We also prove that the problem is polynomially solvable for graphs of bounded treewidth.作者: Reverie 時間: 2025-3-31 16:59
Efficient Connectivity Testing of Hypercubic Networks with Faults,still connected? Even though the answer to this question is negative in general, we describe an algorithm which resolves this problem for the .-dimensional hypercube in time .(|.|n.). Furthermore, we sketch a more general algorithm that is efficient for graph classes with good vertex expansion properties.作者: 使困惑 時間: 2025-3-31 19:01
Dennis Potter: The Angel in Us,umber of nodes in ., . is the height of ., and . is the word length. We also discuss a modification of our algorithm for the unordered tree homeomorphism problem, which corresponds to a tree pattern matching problem for XPath queries with descendant axis only.作者: micturition 時間: 2025-3-31 22:39 作者: Oscillate 時間: 2025-4-1 03:04 作者: Interdict 時間: 2025-4-1 07:33
Six Lectures on Modern Natural Philosophyption, collisions and time. We propose a scheduling of communications based on distributed and fast coloring algorithms which require .(1) computational time. As the localization is referred to coarse-grain coordinates, it happens that more than one sensor is associated with the same coordinates, hence leader-election mechanism is considered.作者: 最后一個 時間: 2025-4-1 11:28
Conversion. The Late Treatises,. We present a polynomial time algorithm that solves . on all input pairs (.,.) where . is a proper interval graph. Thus we identify the first graph class other than trees on which the problem is tractable. As a complementary result, we show that the problem is .-hard on chordal graphs, a superclass of proper interval graphs and trees.作者: DIS 時間: 2025-4-1 16:38 作者: 描繪 時間: 2025-4-1 20:41
,The (2,1)-Total Labeling Number of Outerplanar Graphs Is at Most Δ?+?2,. satisfy ., where Δ(.) is the maximum degree of ., while they also showed that it is true for . with Δ(.)?≥?5. In this paper, we solve their conjecture completely, by proving that . even in the case of Δ(.)?≤?4 .作者: Gingivitis 時間: 2025-4-2 02:00
On Approximation Complexity of Metric Dimension Problem,lete. In particular, we present a greedy constant factor approximation algorithm for these kind of instances and construct a approximation preserving reduction from the bounded degree Dominating Set problem. We also provide first explicit approximation lower bounds for the Metric Dimension problem restricted to dense and bounded degree graphs.
