2430 search results - page 202 / 486 » Computing Tutte Polynomials |
129
click to vote
CORR
2010
Springer
14 years 11 months ago
2010
Springer
This paper addresses the following questions for a given tree T and integer d 2: (1) What is the minimum number of degree-d subtrees that partition E(T)? (2) What is the minimum n...
152
click to vote
MST
2011
14 years 11 months ago
2011
Hierarchical graph definitions allow a modular description of graphs using modules for the specification of repeated substructures. Beside this modularity, hierarchical graph de...
130
Voted
CORR
2011
Springer
14 years 8 months ago
2011
Springer
The Macaulay2 package PHCpack.m2 provides an interface to some of the functionality of PHCpack, a general-purpose solver for polynomial systems by homotopy continuation. The main f...
166
click to vote
CPHYSICS
2011
14 years 8 months ago
2011
In the presented article we present an algorithm for the computation of ground state spin configurations for the 2d random bond Ising model on planar triangular lattice graphs. T...
169
click to vote
ECCC
2011
14 years 8 months ago
2011
Abstract. Given an LLL-basis B of dimension n = hk we accelerate slide-reduction with blocksize k to run under a reasonable assumption within 1 6 n2 h log1+ε α local SVP-computat...