Search
Search Results
-
Dual Linear Programming Problem and One-Dimensional Gromov Minimal Fillings of Finite Metric Spaces
The present paper is devoted to the study of minimal parametric fillings of finite metric spaces (a version of optimal connection problem) by linear...
-
Simple Graph Density Inequalities with No Sum of Squares Proofs
Establishing inequalities among graph densities is a central pursuit in extremal combinatorics. A standard tool to certify the nonnegativity of a...
-
Partially Local Multi-way Alignments
Multiple sequence alignments are an essential tool in bioinformatics and computational biology, where they are used to represent the mutual...
-
On the Complexity of Computing MP Distance Between Binary Phylogenetic Trees
Within the field of phylogenetics there is great interest in distance measures to quantify the dissimilarity of two trees. Recently, a new distance...
-
On the Maximum Parsimony Distance Between Phylogenetic Trees
Within the field of phylogenetics there is great interest in distance measures to quantify the dissimilarity of two trees. Here, based on an idea of...
-
Spectral Characterization of Families of Split Graphs
An upper bound for the sum of the squares of the entries of the principal eigenvector corresponding to a vertex subset inducing a k -regular subgraph...
-
Flow Graphs: Analysis with Near Sets
This paper introduces a framework for flow graphs induced by perceptual systems as well as analysis of such graphs using near set theory. A...
-
Universal Gröbner basis associated with the maximum flow problem
We give a formulation of the maximum flow problem as an integer programming problem in the standard form. We characterize elementary vectors of the...
-
Maximum-weight stable sets and safe lower bounds for graph coloring
The best method known for determining lower bounds on the vertex coloring number of a graph is the linear-programming column-generation technique,...
-
Markov chain-based degree distributions of evolving networks
In this paper, we study a class of stochastic processes, called evolving network Markov chains, in evolving networks. Our approach is to transform...
-
Steiner tree packing revisited
The Steiner tree packing problem (STPP) in graphs is a long studied problem in combinatorial optimization. In contrast to many other problems, where...
-
A geometric approach to the estimation of radial railway network improvement
A geometric approach to radial railway network improvement is presented here. It uses what we have called ‘isochrone circle graphs’, a kind of...
-
On the diameter of partition polytopes and vertex-disjoint cycle cover
We study the combinatorial diameter of partition polytopes, a special class of transportation polytopes. They are associated to partitions of a set X = {...
-
An exact algorithm for graph partitioning
An exact algorithm is presented for solving edge weighted graph partitioning problems. The algorithm is based on a branch and bound method applied to...
-
Non-hereditary Maximum Parsimony trees
In this paper, we investigate a conjecture by Arndt von Haeseler concerning the Maximum Parsimony method for phylogenetic estimation, which was...
-
Half-integrality of node-capacitated multiflows and tree-shaped facility locations on trees
In this paper, we establish a novel duality relationship between node-capacitated multiflows and tree-shaped facility locations. We prove that the...
-
Interactive Genetic Algorithm with fitness modeling for the development of a color simulation system based on customer’s preference
Customers preferences are difficult to predict automatically because they are subjective and relative to human likeness patterns which are different...
-
Behavior of DCA sequences for solving the trust-region subproblem
From our results it follows that any DCA sequence for solving the trust-region subproblem (see Pham Dinh and Le Thi, in SIAM J Optim 8:476–505,
1998 )...