作者: 短程旅游 時(shí)間: 2025-3-21 20:54
Solving Matching Problems Efficiently in Bipartite Graphs, can be obtained in time .(.). For bisplit graphs, (1) we solve maxDMM in time ., and (2) we design an .-time algorithm to count all maximum matchings. This latter time is the same time in which runs the best known algorithm computing the number of maximum matchings in bisplit graphs [.], but our al作者: APNEA 時(shí)間: 2025-3-22 01:42 作者: 爆炸 時(shí)間: 2025-3-22 08:27
0302-9743 archers in designing algorithms field to advance creativeness of intersection between mathematics and computer science. This is the first time this conference is being held in U.S..978-3-319-19314-4978-3-319-19315-1Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: insightful 時(shí)間: 2025-3-22 09:37
René K?nig Schriften. Ausgabe letzter Handbility is in . and that unlike non-circular representability, it is easy to decide. We?also consider the problem of computing minimum length representation (circular) total words, those without holes, and reduce it to a cost/flow network problem.作者: 發(fā)展 時(shí)間: 2025-3-22 15:18 作者: 發(fā)展 時(shí)間: 2025-3-22 18:53 作者: entail 時(shí)間: 2025-3-23 00:18 作者: 伴隨而來(lái) 時(shí)間: 2025-3-23 04:08 作者: 浪費(fèi)物質(zhì) 時(shí)間: 2025-3-23 05:40 作者: peptic-ulcer 時(shí)間: 2025-3-23 12:25
3-Coloring Triangle-Free Planar Graphs with a Precolored 9-Cycle,Given a triangle-free planar graph . and a cycle . of length 9 in ., we characterize all situations where a 3-coloring of . does not extend to a proper 3-coloring of .. This extends previous results for the length of . up?to 8.作者: QUAIL 時(shí)間: 2025-3-23 15:33
Kratochvíl Jan,Mirka Miller,Dalibor FroncekIncludes supplementary material: 作者: connoisseur 時(shí)間: 2025-3-23 20:57 作者: 分開(kāi) 時(shí)間: 2025-3-24 01:02
J. A. J. Metz,A. M. de Roos,F. van den Boschgraphs and .-trees. Little is known, however, about the parameterized complexity of the problem. When parameterized by the vertex cover number of the input graphs, the problem was recently shown to be fixed-parameter tractable. Capitalizing on this result, we show that the problem does not have a po作者: 加入 時(shí)間: 2025-3-24 06:01
https://doi.org/10.1007/978-3-642-74001-5le, undirected graph . and a coloring of the vertices, remove a collection of edges from the graph such that each connected component is . (i.e., it does not contain two identically colored vertices) and the number of edges in the transitive closure of the graph is maximized..The problem is known to作者: Mangle 時(shí)間: 2025-3-24 07:39 作者: 無(wú)彈性 時(shí)間: 2025-3-24 11:47
Setting the Scene for the Sizewell B PWR,elements from the Galois lattice of a bipartite graph is tree-like if and only if the graph is a Bipartite Distance Hereditary graph. We show that the lattice can be realized as the containment relation among directed paths in an arborescence. Moreover, a compact encoding of Bipartite Distance Hered作者: 起皺紋 時(shí)間: 2025-3-24 18:13
https://doi.org/10.1007/978-3-658-28243-1iently: one asymptotically fast; the other very fast on average and in practice. Because the latter approach avoids the computation of global data structures, such as the suffix array and the longest common prefix array, it yields algorithms much faster in practice than existing methods. We show how作者: palliative-care 時(shí)間: 2025-3-24 18:59
Kastell Mola, Naxos, Melia und Mongiuffi,nary vectors of same length indicating the borders. We characterize precisely which of these vectors are valid border correlations, and establish a one-to-one correspondence between the set of valid border correlations and the set of valid period correlations of a given length, the latter being tern作者: 腐敗 時(shí)間: 2025-3-25 00:05
René K?nig Schriften. Ausgabe letzter Handrd characters or holes, was recently considered and shown to be in .. Polynomial-time algorithms that construct representations were described using graph theoretical approaches. As more holes are allowed, representations shrink, and if representation is given, the set can be reconstructed. We furth作者: 自戀 時(shí)間: 2025-3-25 05:03 作者: 公豬 時(shí)間: 2025-3-25 10:54
Gene Therapy for Sj?gren’s Syndromefor approximating the heat kernel pagerank of a graph. The algorithm works by simulating random walks of bounded length and runs in time ., assuming performing a random walk step and sampling from a distribution with bounded support take constant time..The quantitative ranking of vertices obtained w作者: Awning 時(shí)間: 2025-3-25 13:56
Sj?gren‘s Syndrome and Oral Healthqual to the same element . called the magic constant. A graph . is called a group distance magic graph if there exists a .-distance magic labeling for every Abelian group . of order |.(.)|..A .-magic rectangle set . of order . is a collection of . arrays . whose entries are elements of group ., each作者: 健忘癥 時(shí)間: 2025-3-25 17:58 作者: Debrief 時(shí)間: 2025-3-25 22:42 作者: 異教徒 時(shí)間: 2025-3-26 03:15 作者: Metamorphosis 時(shí)間: 2025-3-26 06:30
Michael E. Stern,Stephen C. Pflugfelder Memory Mastermind, which was recently introduced by Doerr and Winzen. We concentrate on the most difficult case, where the codebreaker may store only one question and one answer, called Size-One Memory Mastermind. We consider two variants of the game: the original one, where the answer is coded wit作者: 花費(fèi) 時(shí)間: 2025-3-26 11:10 作者: 潛伏期 時(shí)間: 2025-3-26 15:18 作者: 不遵守 時(shí)間: 2025-3-26 17:42 作者: quiet-sleep 時(shí)間: 2025-3-27 00:09 作者: 密切關(guān)系 時(shí)間: 2025-3-27 02:31 作者: Ejaculate 時(shí)間: 2025-3-27 06:32
Combinatorial Algorithms978-3-319-19315-1Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 艱苦地移動(dòng) 時(shí)間: 2025-3-27 12:35
Elke Theander,Frank A. Wollheimxtension of the Bose construction for Steiner triple systems and a recent result on the Oberwolfach Problem for 2-regular graphs with two components to show that there exists a .-decomposition of . for all ., unless . and ..作者: poliosis 時(shí)間: 2025-3-27 14:19 作者: Flu表流動(dòng) 時(shí)間: 2025-3-27 20:26 作者: 執(zhí) 時(shí)間: 2025-3-28 00:13
Quantifying Privacy: A Novel Entropy-Based Measure of Disclosure Risk,keting research. Numerous techniques have been proposed to protect privacy, including restriction and data modification. Recently proposed privacy models such as differential privacy and k-anonymity received a lot of attention and for the latter there are now several improvements of the original sch作者: Muscularis 時(shí)間: 2025-3-28 02:05 作者: 表示問(wèn) 時(shí)間: 2025-3-28 06:45 作者: Interregnum 時(shí)間: 2025-3-28 12:31
Border Correlations, Lattices, and the Subgraph Component Polynomial,nary vectors of same length indicating the borders. We characterize precisely which of these vectors are valid border correlations, and establish a one-to-one correspondence between the set of valid border correlations and the set of valid period correlations of a given length, the latter being tern作者: grandiose 時(shí)間: 2025-3-28 17:30 作者: 積習(xí)已深 時(shí)間: 2025-3-28 18:52
Computing Primitively-Rooted Squares and Runs in Partial Words,rings that cannot be extended further to the left or right. We show how to compute all the primitively-rooted squares in a given partial word, which is a sequence that may have undefined positions, called holes or wildcards, that match any letter of the alphabet over which the sequence is defined. W作者: 表示向下 時(shí)間: 2025-3-28 23:57 作者: 剝皮 時(shí)間: 2025-3-29 04:47 作者: 態(tài)學(xué) 時(shí)間: 2025-3-29 09:35
Solving Matching Problems Efficiently in Bipartite Graphs,respectively, the number of vertices and the number of edges. We solve maxDMM for bipartite graphs, by providing an .-time algorithm. We design better algorithms for complete bipartite graphs, and . graphs. (Bisplit graphs are bipartite graphs with the nested neighborhood property.) Specifically, we作者: botany 時(shí)間: 2025-3-29 14:06 作者: 狂熱文化 時(shí)間: 2025-3-29 18:21
Reconfiguration of Vertex Covers in a Graph,ere exists a sequence of vertex covers of . which transforms . into . such that each vertex cover in the sequence is of cardinality at most . and is obtained from the previous one by either adding or deleting exactly one vertex. This problem is PSPACE-complete even for planar graphs. In this paper, 作者: 歪曲道理 時(shí)間: 2025-3-29 21:45 作者: Enzyme 時(shí)間: 2025-3-30 00:16 作者: Femish 時(shí)間: 2025-3-30 04:46
Profile-Based Optimal Matchings in the Student/Project Allocation Problem, order of preference. Each student can be assigned to at most one project and there are constraints on the maximum number of students that can be assigned to each project and lecturer. We seek matchings of students to projects that are optimal with respect to ., which is a vector whose .th component作者: Asparagus 時(shí)間: 2025-3-30 08:56 作者: 內(nèi)疚 時(shí)間: 2025-3-30 14:04
J. A. J. Metz,A. M. de Roos,F. van den Boschaphs and graphs of girth five and, unless ., they do not belong to the class . when parameterized by a bound on the size of the minimum feedback vertex sets of the input graphs, that is solving them in polynomial time is very unlikely when this parameter is a constant.作者: 帶子 時(shí)間: 2025-3-30 16:36
Kastell Mola, Naxos, Melia und Mongiuffi,order correlation, and obtain formulas to compute it. We do so using the subgraph component polynomial of an undirected graph, introduced recently by Tittmann et al. (European Journal of Combinatorics, 2011), which counts the number of connected components in vertex induced subgraphs.作者: Reclaim 時(shí)間: 2025-3-31 00:07 作者: Anecdote 時(shí)間: 2025-3-31 02:55
On the Complexity of Various Parameterizations of Common Induced Subgraph Isomorphism,aphs and graphs of girth five and, unless ., they do not belong to the class . when parameterized by a bound on the size of the minimum feedback vertex sets of the input graphs, that is solving them in polynomial time is very unlikely when this parameter is a constant.作者: Bureaucracy 時(shí)間: 2025-3-31 08:51 作者: EVEN 時(shí)間: 2025-3-31 11:08 作者: 脫毛 時(shí)間: 2025-3-31 13:29
0302-9743 on Combinatorial Algorithms, IWOCA 2014, held in Duluth, MN, USA, in October 2014. The 32 revised full papers presented were carefully reviewed and selected from a total of 69 submissions. The papers focus on topics such as Algorithms and Data Structures, Combinatorial Enumeration, Combinatorial Op作者: Gyrate 時(shí)間: 2025-3-31 21:31
Setting the Scene for the Sizewell B PWR, lattice can be realized as the containment relation among directed paths in an arborescence. Moreover, a compact encoding of Bipartite Distance Hereditary graphs is proposed, that allows optimal time computation of neighborhood intersections and maximal bicliques.作者: 格言 時(shí)間: 2025-4-1 01:29
René K?nig Schriften. Ausgabe letzter Hands a sequence that may have undefined positions, called holes or wildcards, that match any letter of the alphabet over which the sequence is defined. We also describe an algorithm for computing all primitively-rooted runs in a given partial word.作者: Trigger-Point 時(shí)間: 2025-4-1 05:53 作者: 拖債 時(shí)間: 2025-4-1 08:24
Computing Primitively-Rooted Squares and Runs in Partial Words,s a sequence that may have undefined positions, called holes or wildcards, that match any letter of the alphabet over which the sequence is defined. We also describe an algorithm for computing all primitively-rooted runs in a given partial word.作者: Angiogenesis 時(shí)間: 2025-4-1 13:32 作者: 繁榮地區(qū) 時(shí)間: 2025-4-1 16:23
Timothy O’Riordan,Ray Kemp,Michael Purdue techniques. In this paper we propose a novel entropy based security measure that can be applied to any generalisation, restriction or data modification technique. We use our measure to empirically evaluate and compare a few popular methods, namely query restriction, sampling and noise addition.作者: 使熄滅 時(shí)間: 2025-4-1 19:17
