V. M. Buchstaber and V. Volodin. Upper and lower bound theorems for graph- associahedra. arXiv preprint arXiv:1005.1631, 2010.V.M. Buchstaber, V.D. Volodin, Upper and lower bound theorems for graph-associahedra, preprint, 2010 (available at: arXiv)....
I've tried using upper-limit=100, rigid, alt-autoscale, and alt-autoscale-max (and several combinations of the above) without any luck. If I make the upper limit 100, and then set it to rigid, it will raise the lower limit so the graph stretches from ~25-100, which isn't exactly...
lower bound of a graph. For example, the value -100 will result in a graph that has a lower limit of -100 or less. Use this keyword to expand graphs down. Am I misinterpreting that? It sounds to me that is supposed to be used when you're graphing a negative graph and want it t...
New upper and lower bounds for the additive degree-Kirchhoff index Given a simple connected graph on N vertices with size |E| and degree sequence d(1) <= d(2) <= ... <= d(N) , the aim of this paper is to exhibit new upper ... M Bianchi,A Cornaro,JL Palacios,... - 《Croa...
The nef cone of a projective variety Y is an important and often elusive invariant. In this paper we construct two polyhedral lower bounds and one polyhedral upper bound for the nef cone of Y using an embedding of Y into a toric variety. The lower bounds generalize the combinatorial descripti...
摘要: log k). All the algorithms are asymptotically optimal, in the sense that the order of the upper bound of the number of channels required is the same as the order of the lower bound关键词: buffer storage cellular radio computational complexity frequency allocation graph colouring land ...
The algebraic connectivity of the graph Laplacian plays an essential role in various multi-agent control systems. In many cases a lower bound of this algebraic connectivity is necessary in order to achieve a certain performance. Lately, several methods based on distributed Power Iteration have been ...
On the positive side, we prove that maximum matching and minimum vertex cover (the dual problem) can be approximated by O(# ) in O(k) rounds, showing that the given lower bound is almost tight. We also give a distributed algorithm which approximates any packing or covering LP by O(n ...
Motivated by a strongly growing interest in anonymizing social network data, we investigate the NP-hard Degree Anonymization problem: given an undirected graph, the task is to add a minimum number of edges such that the graph becomes k-anonymous . That is, for each vertex there have to be ...
> I've tried using upper-limit=100, rigid, alt-autoscale, and > alt-autoscale-max (and several combinations of the above) without any > luck. You've just made the upper-limit rigid. You also want a rigid lower-limit (set to 0). ...