1215 search results - page 161 / 243 » Combinatorics |
127
click to vote
COCOON
2006
Springer
15 years 5 months ago
2006
Springer
Denote by an -component a connected b-uniform hypergraph with k edges and k(b - 1) - vertices. We prove that the expected number of creations of -component during a random hypergr...
146
Voted
COCOON
2005
Springer
15 years 5 months ago
2005
Springer
We consider a variation of the classical problem of finding prices which guarantee equilibrium in linear markets consisting of divisible goods and agents with money. Specificall...
129
Voted
CPM
2005
Springer
15 years 5 months ago
2005
Springer
We present efficient sensitivity-analysis algorithms for two problems involving Markov models of sequence evolution: ancestral reconstruction in evolutionary trees and local ungap...
115
Voted
COCOON
2008
Springer
15 years 5 months ago
2008
Springer
Given a class of graphs, G, a graph G is a probe graph of G if its vertices can be partitioned into two sets, P (the probes) and N (the nonprobes), where N is an independent set, s...
151
click to vote
COCOON
2008
Springer
15 years 5 months ago
2008
Springer
Abstract. We study the maximum flow problem in an undirected planar network with both edge and vertex capacities (EVC-network). A previous study reduces the minimum cut problem in ...