منابع مشابه
Laplacian eigenvalues and partition problems in hypergraphs
We use the generalization of the Laplacian matrix to hypergraphs to obtain several spectral-like results on partition problems in hypergraphs which are computationally difficult to solve (NP-hard or NP-complete). Therefore it is very important to obtain nontrivial bounds. More precisely, the following parameters are bounded in the paper: bipartition width, averaged minimal cut, isoperimetric nu...
متن کاملCrossing Minimization and Layouts of Directed Hypergraphs with Port Constraints
Many practical applications for drawing graphs are modeled by directed graphs with domain specific constraints. In this paper, we consider the problem of drawing directed hypergraphs with (and without) port constraints, which cover multiple real-world graph drawing applications like data flow diagrams and electric schematics. Most existing algorithms for drawing hypergraphs with port constraint...
متن کاملPartition of Graphs and Hypergraphs into Monochromatic Connected Parts
We show that two results on covering of edge colored graphs by monochromatic connected parts can be extended to partitioning. We prove that for any 2-edgecolored non-trivial r-uniform hypergraph H, the vertex set can be partitioned into at most α(H)− r+ 2 monochromatic connected parts, where α(H) is the maximum size of a set of vertices that does not contain any edge. In particular, any 2-edgec...
متن کاملGeometrically Constructed Bases for Homology of Non-Crossing Partition Lattices
For any finite, real reflection group W , we construct a geometric basis for the homology of the corresponding non-crossing partition lattice. We relate this to the basis for the homology of the corresponding intersection lattice introduced by Björner and Wachs in [4] using a general construction of a generic affine hyperplane for the central hyperplane arrangement defined by W .
متن کاملA basis for the non-crossing partition lattice top homology
We find a basis for the top homology of the non-crossing partition lattice Tn . Though Tn is not a geometric lattice, we are able to adapt techniques of Björner (A. Björner, On the homology of geometric lattices. Algebra Universalis 14 (1982), no. 1, 107–128) to find a basis with Cn−1 elements that are in bijection with binary trees. Then we analyze the action of the dihedral group on this basis.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Acta Cybernetica
سال: 2018
ISSN: 0324-721X
DOI: 10.14232/actacyb.23.3.2018.6