Diskretn. Anal. Issled. Oper., 2010, Volume 17, Number 2

RUS ENG

JavaScript is disabled in your browser. Please switch it on to enable full functionality of the website

2010, Volume 17, Number 2

	Perfect 2-colorings of Johnson graphs $J(8,3)$ and $J(8,4)$ S. V. Avgustinovich, I. Yu. Mogilnykh		3
	Acyclic 4-colorability of planar graphs without 4- and 5-cycles O. V. Borodin		20
	On the issue of algorithmic complexity of one cluster analysis problem A. V. Dolgushev, A. V. Kel'manov		39
	On a connection between the switching separability of a graph and of its subgraphs D. S. Krotov		46
	Solutions of a cooperative differential group pursuit game Ya. B. Pankratova		57
	Linear-fractional exchange model. Part 2: Algorithm of meeting trajectories for the fixed budget model V. I. Shmyrev		79