Titlebook: Combinatorial Algorithms; 20th International W Ji?í Fiala,Jan Kratochvíl,Mirka Miller Conference proceedings 2009 Springer-Verlag Berlin He

吞沒(méi)

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

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

某人

似少年

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

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

脫離

Bmd955

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

事與愿違

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