449 search results - page 14 / 90 » Degenerate crossing numbers |
COMPGEOM
1996
ACM
13 years 11 months ago
1996
ACM
Given a simple arrangementof n pseudolines in the Euclidean plane, associate with line i the list i of the lines crossing i in the order of the crossings on line i. i = ( i 1; i 2;...
B
1998
Springer
13 years 11 months ago
1998
Springer
Let predicate P be converted from Boolean to numeric type by writing P , with false being 0 and true being 1, so that in a degenerate sense P can be regarded as `the probability th...
RSA
2006
13 years 7 months ago
2006
We study the asymptotic behaviour of the number Nk,n of nodes of given degree k in unlabeled random trees, when the tree size n and the node degree k both tend to infinity. It is s...
ATAL
2004
Springer
14 years 24 days ago
2004
Springer
The development of autonomous multi-agent systems acting upon the interests of one or more users involves the elicitation of preferences of these users. In decision theory, models...
WALCOM
2010
IEEE
14 years 2 months ago
2010
IEEE
Abstract. Directed graphs are commonly drawn by the Sugiyama algorithm, where crossing reduction is a crucial phase. It is done by repeated one-sided 2-level crossing minimizations...