Sciweavers

451
Voted
COCOON
2011
Springer
14 years 26 days ago
Proper n-Cell Polycubes in n - 3 Dimensions
A d-dimensional polycube of size n is a connected set of n cubes in d dimensions, where connectivity is through (d−1)-dimensional faces. Enumeration of polycubes, and, in particu...
Andrei Asinowski, Gill Barequet, Ronnie Barequet, ...
290
Voted
COCOON
2011
Springer
14 years 26 days ago
Finding Paths with Minimum Shared Edges
Motivated by a security problem in geographic information systems, we study the following graph theoretical problem: given a graph G, two special nodes s and t in G, and a number k...
Masoud T. Omran, Jörg-Rüdiger Sack, Hami...
334
Voted
COCOON
2011
Springer
14 years 26 days ago
Exact Parameterized Multilinear Monomial Counting via k-Layer Subset Convolution and k-Disjoint Sum
Dongxiao Yu, Yuexuan Wang, Qiang-Sheng Hua, Franci...
Combinatorics
Top of PageReset Settings