Sciweavers

9 search results - page 1 / 2
» Seidel Minor, Permutation Graphs and Combinatorial Propertie...
Sort
View
ISAAC
2010
Springer
230views Algorithms» more  ISAAC 2010»
13 years 2 months ago
Seidel Minor, Permutation Graphs and Combinatorial Properties
A permutation graph is an intersection graph of segments lying between two parallel lines. A Seidel complementation of a finite graph at a vertex v consists in complementing the ed...
Vincent Limouzy
COMBINATORICS
2000
129views more  COMBINATORICS 2000»
13 years 4 months ago
Combinatorial statistics on type-B analogues of noncrossing partitions and restricted permutations
We define type-B analogues of combinatorial statistics previously studied on noncrossing partitions and show that analogous equidistribution and symmetry properties hold in the ca...
Rodica Simion
COMBINATORICS
1998
84views more  COMBINATORICS 1998»
13 years 4 months ago
Multimatroids II. Orthogonality, minors and connectivity
A multimatroid is a combinatorial structure that encompasses matroids, delta-matroids and isotropic systems. This structure has been introduced to unify a theorem of Edmonds on th...
André Bouchet
LICS
2010
IEEE
13 years 2 months ago
Fixed-Point Definability and Polynomial Time on Graphs with Excluded Minors
We prove that fixed-point logic with counting captures polynomial time on all classes of graphs with excluded minors. That is, for every class C of graphs such that some graph H is...
Martin Grohe
SODA
2010
ACM
179views Algorithms» more  SODA 2010»
14 years 2 months ago
Property Testing and Parameter Testing for Permutations
There has been great interest in deciding whether a combinatorial structure satisfies some property, or in estimating the value of some numerical function associated with this com...
Carlos Hoppen, Yoshiharu Kohayakawa, Carlos G. T. ...