作者: omnibus 時間: 2025-3-21 20:54 作者: Ovulation 時間: 2025-3-22 04:01 作者: 永久 時間: 2025-3-22 04:40
,On Erd?s–Szekeres-Type Problems for ,-convex Point Sets,inite set . of . points is . if there exists a spanning simple polygonization of . such that the intersection of any straight line with its interior consists of at most . connected components. We address several open problems about .-convex point sets. In particular, we extend the well-known Erd?s–S作者: BAN 時間: 2025-3-22 09:30 作者: abduction 時間: 2025-3-22 13:36
Fixed-Parameter Tractability of , List Coloring,aph and the goal is to color the vertices of the graph with minimum number of colors so that end points of each edge gets different colors. In list-coloring, each vertex is given a list of allowed colors with which it can be colored..In parameterized complexity, the goal is to identify natural param作者: abduction 時間: 2025-3-22 19:34 作者: tackle 時間: 2025-3-22 23:55 作者: Jacket 時間: 2025-3-23 04:06
Solving Group Interval Scheduling Efficiently,g in exactly one time interval from a group . of allowed intervals. The objective is to determine if there is a set of . of . jobs which can be scheduled in non-overlapping time intervals..This work describes a deterministic algorithm for the problem that runs in time ., where . and . is a constant.作者: prostatitis 時間: 2025-3-23 05:35 作者: hardheaded 時間: 2025-3-23 13:25
Power Edge Set and Zero Forcing Set Remain Difficult in Cubic Graphs,exploiting their structural properties to improve and refine previous results. We also give hardness results for parameterized precolored versions of these problems, and a polynomial-time algorithm for . in proper interval graphs.作者: 飛鏢 時間: 2025-3-23 14:17 作者: Cosmopolitan 時間: 2025-3-23 20:03 作者: 高射炮 時間: 2025-3-24 02:01 作者: 終止 時間: 2025-3-24 05:29 作者: Substitution 時間: 2025-3-24 08:34 作者: overbearing 時間: 2025-3-24 10:47 作者: FADE 時間: 2025-3-24 16:06
The Hull Number in the Convexity of Induced Paths of Order 3,ning .. If the .-convex hull of . is .(.), then . is a .. The minimum size of a .-hull set is the .. In this paper, we show that the problem of deciding whether the .-hull number of a chordal graph is at most . is .-complete and present a linear-time algorithm to determine this parameter and provide作者: 沙草紙 時間: 2025-3-24 21:24
Supermagic Graphs with Many Odd Degrees, is equal to the same number ., called the ...Recently, Ková? et al. affirmatively answered a question by Madaras about existence of supermagic graphs with arbitrarily many different degrees. Their construction provided graphs with all degrees even. Therefore, they asked if there exists a supermagic作者: 心神不寧 時間: 2025-3-24 23:12
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/c/image/229881.jpg作者: 音樂戲劇 時間: 2025-3-25 06:34
Combinatorial Algorithms978-3-030-25005-8Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: irritation 時間: 2025-3-25 09:28
https://doi.org/10.1007/978-88-470-0700-0eriods in Cartesian tree matching, and present an .(.) time algorithm for finding all full periods, an . time algorithm for finding all initial periods, and an . time algorithm for finding all general periods of a string of length ..作者: judicial 時間: 2025-3-25 14:53 作者: 和藹 時間: 2025-3-25 18:01 作者: indifferent 時間: 2025-3-25 20:44
https://doi.org/10.1007/978-3-030-25005-8approximation algorithms; artificial intelligence; bipartite graphs; combinatorial algorithms; combinato作者: SPASM 時間: 2025-3-26 01:28 作者: Infuriate 時間: 2025-3-26 07:04
Finding Periods in Cartesian Tree Matching,eriods in Cartesian tree matching, and present an .(.) time algorithm for finding all full periods, an . time algorithm for finding all initial periods, and an . time algorithm for finding all general periods of a string of length ..作者: 完成 時間: 2025-3-26 11:31
Power Edge Set and Zero Forcing Set Remain Difficult in Cubic Graphs,exploiting their structural properties to improve and refine previous results. We also give hardness results for parameterized precolored versions of these problems, and a polynomial-time algorithm for . in proper interval graphs.作者: nautical 時間: 2025-3-26 15:39
The Hull Number in the Convexity of Induced Paths of Order 3,ning .. If the .-convex hull of . is .(.), then . is a .. The minimum size of a .-hull set is the .. In this paper, we show that the problem of deciding whether the .-hull number of a chordal graph is at most . is .-complete and present a linear-time algorithm to determine this parameter and provide a minimum .-hull set for unit interval graphs.作者: Enteropathic 時間: 2025-3-26 18:02 作者: BILK 時間: 2025-3-26 22:54 作者: Exonerate 時間: 2025-3-27 04:35
https://doi.org/10.1007/978-3-540-48593-3ries using two bitprobes. We propose a scheme that stores arbitrary subsets of size four using . amount of space. This improves upon the non-explicit scheme proposed by Garg and Radhakrishnan?[.] which uses . amount of space, and the explicit scheme proposed by Garg?[.] which uses . amount of space.作者: GOAT 時間: 2025-3-27 07:39 作者: nutrition 時間: 2025-3-27 10:36 作者: Herpetologist 時間: 2025-3-27 14:45
https://doi.org/10.1007/978-88-470-0700-0aph and the goal is to color the vertices of the graph with minimum number of colors so that end points of each edge gets different colors. In list-coloring, each vertex is given a list of allowed colors with which it can be colored..In parameterized complexity, the goal is to identify natural param作者: 謊言 時間: 2025-3-27 19:27 作者: acrobat 時間: 2025-3-28 01:11 作者: 元音 時間: 2025-3-28 04:27
https://doi.org/10.1007/978-88-470-0700-0g in exactly one time interval from a group . of allowed intervals. The objective is to determine if there is a set of . of . jobs which can be scheduled in non-overlapping time intervals..This work describes a deterministic algorithm for the problem that runs in time ., where . and . is a constant.作者: 取之不竭 時間: 2025-3-28 07:07 作者: 名詞 時間: 2025-3-28 12:38
https://doi.org/10.1007/978-88-470-0700-0exploiting their structural properties to improve and refine previous results. We also give hardness results for parameterized precolored versions of these problems, and a polynomial-time algorithm for . in proper interval graphs.作者: 我要沮喪 時間: 2025-3-28 14:47
https://doi.org/10.1007/978-88-470-0700-0cted components are colourful. Given a vertex-coloured graph, the . problem asks whether there exist at most . edges whose removal makes the graph colourful, and the . problem asks whether there exists a partition of the vertex set with at most . parts such that each part induces a colourful compone作者: 團(tuán)結(jié) 時間: 2025-3-28 19:42 作者: facetious 時間: 2025-3-29 00:12 作者: 裝飾 時間: 2025-3-29 04:28 作者: 和平主義 時間: 2025-3-29 10:27
https://doi.org/10.1007/978-88-470-0700-0 starting with Player?1, alternately the players may move each of their tokens to the adjacent vertices. Player?1 wins if, after a finite number of moves, a cop and the robber end up on the same vertex and Player?2 wins otherwise. However, depending on the type of moves the players make, there are t作者: 飛鏢 時間: 2025-3-29 13:45 作者: 匯總 時間: 2025-3-29 19:30 作者: 修正案 時間: 2025-3-29 19:47
https://doi.org/10.1007/978-88-470-0700-0 is equal to the same number ., called the ...Recently, Ková? et al. affirmatively answered a question by Madaras about existence of supermagic graphs with arbitrarily many different degrees. Their construction provided graphs with all degrees even. Therefore, they asked if there exists a supermagic作者: RAGE 時間: 2025-3-30 00:23 作者: violate 時間: 2025-3-30 05:40
An Improved Scheme in the Two Query Adaptive Bitprobe Model, The proposed scheme also answers an open problem posed by Nicholson?[.] in the affirmative. Furthermore, we look into a counterexample that shows that our proposed scheme cannot be used to store five or more elements.作者: 爭議的蘋果 時間: 2025-3-30 11:30
Parameterized Complexity of Min-Power Asymmetric Connectivity, subgraph or the feedback edge number in the underlying undirected graph is constant. Complementing these results, we prove that the problem is W[2]-hard with respect to the solution cost, even on restricted graphs with one feedback arc and binary arc weights.作者: lymphedema 時間: 2025-3-30 12:38
Solving Group Interval Scheduling Efficiently, For ., this is significantly faster than the best previously-known deterministic algorithm, which runs in time .. We obtain our speedup using efficient constructions of ., which can be used to solve the problem by a dynamic programming approach.作者: 細(xì)菌等 時間: 2025-3-30 20:01 作者: abstemious 時間: 2025-3-30 22:45
0302-9743 on security, algorithms on strings and graphs, graph drawing and labelling, computational algebra and geometry, computational biology, probabilistic and randomized algorithms, algorithms for big data analytics, and new paradigms of computation..978-3-030-25004-1978-3-030-25005-8Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 疼死我了 時間: 2025-3-31 03:36
0302-9743 held in Pisa, Italy, in July 2019. The 36 regular papers presented in this volume were carefully reviewed and selected from 73 submissions. They cover diverse areas of combinatorical algorithms, complexity theory, graph theory and combinatorics, combinatorial optimization, cryptography and informati作者: DEMN 時間: 2025-3-31 07:41
https://doi.org/10.1007/978-88-470-0700-0 with arbitrarily many different degrees. Their construction provided graphs with all degrees even. Therefore, they asked if there exists a supermagic graph with . different odd degrees for any positive integer ...We answer this question in the affirmative by providing a construction based on the use of 3-dimensional magic rectangles.作者: BILIO 時間: 2025-3-31 10:46
Supermagic Graphs with Many Odd Degrees, with arbitrarily many different degrees. Their construction provided graphs with all degrees even. Therefore, they asked if there exists a supermagic graph with . different odd degrees for any positive integer ...We answer this question in the affirmative by providing a construction based on the use of 3-dimensional magic rectangles.作者: 訓(xùn)誡 時間: 2025-3-31 13:43
Conference proceedings 2019sa, Italy, in July 2019. The 36 regular papers presented in this volume were carefully reviewed and selected from 73 submissions. They cover diverse areas of combinatorical algorithms, complexity theory, graph theory and combinatorics, combinatorial optimization, cryptography and information securit作者: Abnormal 時間: 2025-3-31 18:08 作者: bizarre 時間: 2025-4-1 01:30
https://doi.org/10.1007/978-88-470-0700-0 show a . bits lower bound for the space complexity of any (randomized) streaming algorithm for Liar’s dominating set problem as well as for the .-tuple dominating set problem. Furthermore, we prove that the Liar’s dominating set problem on bipartite graphs is W[2]-hard.作者: STAT 時間: 2025-4-1 05:08 作者: 膽汁 時間: 2025-4-1 06:49 作者: 發(fā)酵劑 時間: 2025-4-1 13:26
A Note on Handicap Incomplete Tournaments, of a .(.,?.). In this paper, we give a method to construct new .-handicap graphs from .-handicap graphs for all . and as an application, we characterize the .-handicap labeling of Hamming graphs. Further, we give another method to construct .(.,?.) from an infinite class of .(.,?.) by increasing the number of rounds in .(.,?.).作者: FLOAT 時間: 2025-4-1 15:37
,Algorithm and Hardness Results on Liar’s Dominating Set and ,-tuple Dominating Set, show a . bits lower bound for the space complexity of any (randomized) streaming algorithm for Liar’s dominating set problem as well as for the .-tuple dominating set problem. Furthermore, we prove that the Liar’s dominating set problem on bipartite graphs is W[2]-hard.作者: Infirm 時間: 2025-4-1 18:31
Reaching 3-Connectivity via Edge-Edge Additions,nted graph..As a relevant application, we show how to exploit this augmentation technique to extend some classical .-hardness results for bounded-degree 2-connected planar graphs to bounded-degree 3-connected planar graphs.作者: Delectable 時間: 2025-4-2 01:54
Cops and Robber on Some Families of Oriented Graphs, . if Player?1 playing with a single cop has a winning strategy. In this article, we study the three models on some families of oriented graphs and characterize the cop-win directed graphs for the third model.
