標題: Titlebook: Combinatorial Algorithms; 20th International W Ji?í Fiala,Jan Kratochvíl,Mirka Miller Conference proceedings 2009 Springer-Verlag Berlin He [打印本頁] 作者: 軍械 時間: 2025-3-21 17:48
書目名稱Combinatorial Algorithms影響因子(影響力)
書目名稱Combinatorial Algorithms影響因子(影響力)學科排名
書目名稱Combinatorial Algorithms網(wǎng)絡公開度
書目名稱Combinatorial Algorithms網(wǎng)絡公開度學科排名
書目名稱Combinatorial Algorithms被引頻次
書目名稱Combinatorial Algorithms被引頻次學科排名
書目名稱Combinatorial Algorithms年度引用
書目名稱Combinatorial Algorithms年度引用學科排名
書目名稱Combinatorial Algorithms讀者反饋
書目名稱Combinatorial Algorithms讀者反饋學科排名
作者: Chivalrous 時間: 2025-3-21 21:41 作者: AVID 時間: 2025-3-22 03:18
Edge-Simple Circuits through 10 Ordered Vertices in Square Grids作者: glacial 時間: 2025-3-22 08:28
Evaluation of Recoverable-Robust Timetables on Tree Networkstimetable is measured by the ., i.e. the ratio between the cost of the robust timetable and that of a non-robust optimal timetable. The considered problem is known to be .-hard. We propose a pseudo-polynomial time algorithm and apply it on random networks and real case scenarios provided by Italian 作者: 清洗 時間: 2025-3-22 08:44 作者: creditor 時間: 2025-3-22 14:48 作者: creditor 時間: 2025-3-22 19:22
978-3-642-10216-5Springer-Verlag Berlin Heidelberg 2009作者: 充氣球 時間: 2025-3-22 21:50
https://doi.org/10.1007/978-3-540-32350-1This paper reports on three recent research directions that begin to explore the subject of fully multivariate algorithmics, meaning by this the largely uncharted theoretical landscape that lies beyond parameterized complexity and algorithmics — itself a natural two-dimensional generalization of the familiar one-dimensional framework of ....作者: innovation 時間: 2025-3-23 03:55
https://doi.org/10.1007/3-540-29142-3The fixed parameter tractability (FPT) approach pioneered by Downey and Fellows provides an algorithm design philosophy for solving special cases of intractable problems. Here we review several examples from geometry and graph drawing, in particular layered graph drawing, that illustrate fixed parameter tractability techniques.作者: CANON 時間: 2025-3-23 06:43
Towards Fully Multivariate Algorithmics: Some New Results and Directions in Parameter EcologyThis paper reports on three recent research directions that begin to explore the subject of fully multivariate algorithmics, meaning by this the largely uncharted theoretical landscape that lies beyond parameterized complexity and algorithmics — itself a natural two-dimensional generalization of the familiar one-dimensional framework of ....作者: intimate 時間: 2025-3-23 13:10
Intractability in Graph Drawing and Geometry: FPT ApproachesThe fixed parameter tractability (FPT) approach pioneered by Downey and Fellows provides an algorithm design philosophy for solving special cases of intractable problems. Here we review several examples from geometry and graph drawing, in particular layered graph drawing, that illustrate fixed parameter tractability techniques.作者: Fantasy 時間: 2025-3-23 15:32
Combinatorial Algorithms978-3-642-10217-2Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: Cardioversion 時間: 2025-3-23 19:24 作者: grieve 時間: 2025-3-24 01:46
,MEASURE Wie gro? ist das Problem?,simplicity of the usual pointer-based implementation in which to move from parent to child we simply follow a pointer. Unfortunately, a simple counting argument shows that the pointer-based implementation is highly redundant. The number of distinct trees with . nodes is given by the .-th Catalan number: 作者: 一回合 時間: 2025-3-24 06:09
Joanna M. Kain,Murray T. Brown,Marc Lahayebe specified in terms of combinatorial specifications. Studying these trees via generating functions, we show a Rayleigh limiting distribution for expected distances between pairs of vertices in a random .-tree: in a .-tree on . vertices, the proportion of vertices at distance . from a random vertex is asymptotic to ., where ..?=?....作者: Bone-Scan 時間: 2025-3-24 09:53 作者: diabetes 時間: 2025-3-24 11:26
,MEASURE Wie gro? ist das Problem?,simplicity of the usual pointer-based implementation in which to move from parent to child we simply follow a pointer. Unfortunately, a simple counting argument shows that the pointer-based implementation is highly redundant. The number of distinct trees with . nodes is given by the .-th Catalan num作者: EVEN 時間: 2025-3-24 17:51
,MEASURE Wie gro? ist das Problem?,g-standing conjecture of Hadwiger states that every graph with no . minor is (.???1)-colorable. Hadwiger’s conjecture is known for .?≤?6, and open for all .?>?7..A deep theorem of Robertson and Seymour describes the structure of graphs with no . minor. The theorem is very powerful, but it is fairly 作者: Magnitude 時間: 2025-3-24 21:47 作者: Ventricle 時間: 2025-3-25 00:08 作者: 吞沒 時間: 2025-3-25 06:09
https://doi.org/10.1007/3-540-29142-3uemper’s characterization of balanceable matrices). In this paper we study a proper subclass of balanceable clutters called quasi-graphical defined by forbidding one-sided even wheels and one-sided even 3-path configurations. We characterize Mengerian quasi-graphical clutters and, as a consequence, 作者: Libido 時間: 2025-3-25 07:42
https://doi.org/10.1007/3-540-29142-3f edges in any member of .. This bound is tight up to a (log.). multiplicative factor and improves the previous bound presented in [1]..We also obtain a relationship connecting the oriented chromatic number ..(.) of graphs and the .-subgraph chromatic numbers . introduced and studied in [1]. In part作者: debris 時間: 2025-3-25 14:52 作者: 某人 時間: 2025-3-25 16:01 作者: 似少年 時間: 2025-3-25 22:51
https://doi.org/10.1007/3-540-29142-3n induced subgraph. First of all, we show that the pre-coloring extension version of 5-coloring remains NP-complete when restricted to ..-free graphs. Recent results of Hoàng et al. imply that this problem is polynomially solvable on ..-free graphs. Secondly, we show that the pre-coloring extension 作者: declamation 時間: 2025-3-26 02:24
https://doi.org/10.1007/978-1-349-18979-3er a given split graph is fully decomposable, i.e., whether it can be partitioned into connected parts of order ..,..,...,.. for every ..,..,...,.. summing up to the order of the graph. In contrast, we show that the decision problem whether a given split graph can be partitioned into connected parts作者: RENIN 時間: 2025-3-26 04:18 作者: 脫離 時間: 2025-3-26 10:32 作者: Bmd955 時間: 2025-3-26 12:42
https://doi.org/10.1007/978-3-319-75829-9vertex in .(.) time, where . is its degree. To that purpose, we introduce a new parameter, called linearity, that would solve the problem if bounded for the two classes. Surprisingly, we show that it is not. Nevertheless, we design representations with the desired property for the two classes, and w作者: 事與愿違 時間: 2025-3-26 18:18
https://doi.org/10.1007/BFb0106552ing the Suffix Array of the text. They compute the maximal length of the previous factor (subword) occurring at each position of the text in a table called .. This notion is central both in many conservative text compression techniques and in the most efficient algorithms for detecting motifs and re作者: tympanometry 時間: 2025-3-26 22:23
Joanna M. Kain,Murray T. Brown,Marc Lahayebe specified in terms of combinatorial specifications. Studying these trees via generating functions, we show a Rayleigh limiting distribution for expected distances between pairs of vertices in a random .-tree: in a .-tree on . vertices, the proportion of vertices at distance . from a random vertex作者: 水槽 時間: 2025-3-27 01:49 作者: 分離 時間: 2025-3-27 08:48 作者: Demonstrate 時間: 2025-3-27 09:33 作者: offense 時間: 2025-3-27 14:03
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/c/image/229885.jpg作者: scotoma 時間: 2025-3-27 18:43 作者: 口訣法 時間: 2025-3-27 21:59 作者: 幻影 時間: 2025-3-28 04:09
Minors in Large ,-Connected Graphsg-standing conjecture of Hadwiger states that every graph with no . minor is (.???1)-colorable. Hadwiger’s conjecture is known for .?≤?6, and open for all .?>?7..A deep theorem of Robertson and Seymour describes the structure of graphs with no . minor. The theorem is very powerful, but it is fairly 作者: IST 時間: 2025-3-28 07:41
Evaluation of Recoverable-Robust Timetables on Tree Networksl point of view. The motivation behind it is to cope with scheduled activities which might be subject to unavoidable disturbances, such as delays, occurring during the operational phase. The idea is to preventively plan some extra time for the scheduled activities in order to be “prepared” if a dela作者: 格子架 時間: 2025-3-28 11:51
Weighted LCSut strings is assigned a positive weight the problem becomes the .(HCS) problem. In this paper we consider a different version of weighted LCS on .(PWM). The Position Weight Matrix was introduced as a tool to handle a set of sequences that are not identical, yet, have many local similarities. Such a作者: 厚顏無恥 時間: 2025-3-28 14:52
Integrality Properties of Certain Special Balanceable Familiesuemper’s characterization of balanceable matrices). In this paper we study a proper subclass of balanceable clutters called quasi-graphical defined by forbidding one-sided even wheels and one-sided even 3-path configurations. We characterize Mengerian quasi-graphical clutters and, as a consequence, 作者: 橫截,橫斷 時間: 2025-3-28 21:20 作者: PRO 時間: 2025-3-29 01:41
Polynomial Kernels for 3-Leaf Power Graph Modification Problems in .. The 3-leaf power edge modification problems, . edition (also known as the .3.), completion and edge-deletion are FPT when parameterized by the size of the edge set modification. However, a polynomial kernel was known for none of these three problems. For each of them, we provide a kernel with作者: Flagging 時間: 2025-3-29 03:54 作者: 灰姑娘 時間: 2025-3-29 09:31 作者: Pigeon 時間: 2025-3-29 14:26
Fully Decomposable Split Graphser a given split graph is fully decomposable, i.e., whether it can be partitioned into connected parts of order ..,..,...,.. for every ..,..,...,.. summing up to the order of the graph. In contrast, we show that the decision problem whether a given split graph can be partitioned into connected parts作者: 漸變 時間: 2025-3-29 19:35
Feedback Vertex Set on Graphs of Low Cliquewidthnnot check if . vertices meet all cycles by looking only at their neighbors. Dynamic programming algorithms for problems based on non-local properties are usually more complicated. In this paper, given a graph . of cliquewidth . and a .-expression of ., we solve the Minimum Feedback Vertex Set probl作者: certitude 時間: 2025-3-29 20:22
Note on Decomposition of ,, into (0,,)-prismste graph ... In?[2] the first two authors established a necessary and sufficient condition for the existence of a factorization of the complete bipartite graph .. into certain families of 3-regular graphs of order 2.. In this paper we tackle the problem of decompositions of .. into 3-regular graphs 作者: capillaries 時間: 2025-3-30 00:35 作者: CRASS 時間: 2025-3-30 08:06 作者: 侵略主義 時間: 2025-3-30 10:59 作者: nettle 時間: 2025-3-30 12:48
Conference proceedings 2009 of Hradec nad Moravicí, Czech Republic. The 41 papers included in this volume together with 5 invited papers were carefully reviewed and selected from over 100 submissions. The topics dealt with are algorithms and data structures, applications, combinatorial enumeration, combinatorial optimization,作者: accomplishment 時間: 2025-3-30 17:01
0302-9743 the castle of Hradec nad Moravicí, Czech Republic. The 41 papers included in this volume together with 5 invited papers were carefully reviewed and selected from over 100 submissions. The topics dealt with are algorithms and data structures, applications, combinatorial enumeration, combinatorial opt作者: 軍械庫 時間: 2025-3-30 21:06
https://doi.org/10.1007/3-540-29142-3 forbidding one-sided even wheels and one-sided even 3-path configurations. We characterize Mengerian quasi-graphical clutters and, as a consequence, we show that a recent conjecture in [5] is true for quasi-graphical clutters.作者: anthropologist 時間: 2025-3-31 03:10
https://doi.org/10.1007/3-540-29142-3size of the edge set modification. However, a polynomial kernel was known for none of these three problems. For each of them, we provide a kernel with .(..) vertices that can be computed in linear time. We thereby answer an open question first mentioned by Dom, Guo, Hüffner and Niedermeier?[9].作者: 演講 時間: 2025-3-31 08:23 作者: 誰在削木頭 時間: 2025-3-31 09:28 作者: 載貨清單 時間: 2025-3-31 15:31
https://doi.org/10.1007/978-3-319-75829-9or the two classes. Surprisingly, we show that it is not. Nevertheless, we design representations with the desired property for the two classes, and we implement the Breadth-First Search algorithm in .(.) time for permutation graphs; thereby lowering the complexity of All Pairs Shortest Paths and Single Source Shortest Path problems for the class.作者: 怎樣才咆哮 時間: 2025-3-31 19:43
Integrality Properties of Certain Special Balanceable Families forbidding one-sided even wheels and one-sided even 3-path configurations. We characterize Mengerian quasi-graphical clutters and, as a consequence, we show that a recent conjecture in [5] is true for quasi-graphical clutters.作者: 文件夾 時間: 2025-3-31 23:55 作者: HAUNT 時間: 2025-4-1 04:12
Fully Decomposable Split Graphsmming up to the order of the graph. In contrast, we show that the decision problem whether a given split graph can be partitioned into connected parts of order ..,..,...,.. for a given partition ..,..,...,.. of the order of the graph, is NP-hard.作者: Peculate 時間: 2025-4-1 08:27
Note on Decomposition of ,, into (0,,)-prismsite graph .. into certain families of 3-regular graphs of order 2.. In this paper we tackle the problem of decompositions of .. into 3-regular graphs some more. We will show that certain families of 3-regular graphs of order 2. decompose the complete bipartite graph ..作者: 確認 時間: 2025-4-1 12:21 作者: enfeeble 時間: 2025-4-1 17:58 作者: homocysteine 時間: 2025-4-1 20:18 作者: dysphagia 時間: 2025-4-2 00:45
https://doi.org/10.1007/BFb0106552petitions occurring in a text..The main results are: a linear-time algorithm that computes explicitly the permutation that transforms the . table into the . table; a time-space optimal computation of the . table; and an .(.log.) strong in-place computation of the . table.作者: 財產(chǎn) 時間: 2025-4-2 02:49
https://doi.org/10.1007/3-540-29142-3sider two possible definitions of LCS on PWM. For the first, we solve the weighted LCS problem of . sequences in time .(..). For the second, we prove .-hardness and provide an approximation algorithm.作者: Commemorate 時間: 2025-4-2 09:24
