Combinatorics of TCP reordering
type: Item
instance of: scholarly article
title: Combinatorics of TCP reordering
zbMATH Open document ID: 1132.90365
author: N. E. Zubov
published in: Journal of Combinatorial Optimization
publication date: 2007-01-05T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90B20
zbMATH DE Number: 5081890
zbMATH Keywords: traffic
zbMATH Keywords: combinatorial problem
MaRDI profile type: Publication
full work available at URL: s10878-006-8904-0
OpenAlex ID: W2080577122
cites work: Accelerating simulated annealing for the permanent and combinatorial counting problems
cites work: On the fixed parameter complexity of graph enumeration problems definable in monadic second-order logic
cites work: Counting preimages of TCP reordering patterns
cites work: A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries
cites work: Random generation of combinatorial structures from a uniform distribution
cites work: Graph minors. II. Algorithmic aspects of tree-width
DOI: 10.1007/S10878-006-8904-0
description: scientific article; zbMATH DE number 5081890