3221 search results - page 389 / 645 » Termination of Linear Programs |
135
click to vote
NETWORKS
2006
15 years 6 months ago
2006
We define binet matrices, which furnish a direct generalization of totally unimodular network matrices and arise from the node-edge incidence matrices of bidirected graphs in the ...
151
click to vote
IPL
2007
15 years 6 months ago
2007
Dynamic networks are characterized by transit times on edges. Dynamic flow problems consider transshipment problems in dynamic networks. We introduce a new version of dynamic fl...
175
click to vote
IPL
2000
15 years 6 months ago
2000
Given a polyhedron P by a list of inequalities we develop unbiased estimates of the number of vertices and bases of P. The estimates are based on applying tree estimation methods ...
204
click to vote
CORR
1999
Springer
15 years 6 months ago
1999
Springer
We solve the subgraph isomorphism problem in planar graphs in linear time, for any pattern of constant size. Our results are based on a technique of partitioning the planar graph ...
147
click to vote
JLP
1998
15 years 6 months ago
1998
Using constraint logic techniques, it is made possible to use a wellknown metainterpreter backwards as a device for generating programs. A metainterpreter is developed, which prov...