Sciweavers

396 search results - page 35 / 80
» Odd Crossing Number Is Not Crossing Number
Sort
View
COMBINATORICS
2006
135views more  COMBINATORICS 2006»
14 years 9 months ago
Drawing a Graph in a Hypercube
A d-dimensional hypercube drawing of a graph represents the vertices by distinct points in {0, 1}d, such that the line-segments representing the edges do not cross. We study lower...
David R. Wood
JCT
2008
53views more  JCT 2008»
14 years 9 months ago
A major index for matchings and set partitions
We introduce a statistic pmaj(P) for partitions of [n], and show that it is equidistributed with cr2, the number of 2-crossings, over all partitions of [n] with given sets of mini...
William Y. C. Chen, Ira M. Gessel, Catherine H. Ya...
IWC
2000
99views more  IWC 2000»
14 years 9 months ago
Effective information visualisation: a study of graph drawing aesthetics and algorithms
Information visualisation systems which generate diagrams representing discrete relational information must consider potential users if they are to be effective. Many algorithms w...
Helen C. Purchase
IPL
2002
89views more  IPL 2002»
14 years 9 months ago
New bounds on the barycenter heuristic for bipartite graph drawing
The barycenter heuristic is often used to solve the NP-hard two-layer edge crossing minimization problem. It is well-known that the barycenter heuristic can give solutions as bad a...
Xiao Yu Li, Matthias F. M. Stallmann
ISBI
2008
IEEE
15 years 10 months ago
On the uncertainty in sequential hypothesis testing
We consider the problem of sequential hypothesis testing when the exact pdfs are not known but instead a set of iid samples are used to describe the hypotheses. We modify the clas...
Antonio Artés-Rodríguez, Fernando P&...