Constraint programming techniques for solving problems on graphs

被引：0

作者：

Sidorov, V

Telerman, V

Ushakov, D

机构：

[1] AP Ershov Inst Informat Syst, Novosibirsk 630090, Russia

[2] Russian Res Inst Artificial Intelligence, Novosibirsk 630090, Russia

来源：

PERSPECTIVES OF SYSTEM INFORMATICS | 2000年 / 1755卷

关键词：

D O I：

暂无

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

In this paper we examine a technology for solving problems on graphs in the constraint programming framework called Subdefinite Models. We describe in brief the mechanism of constraint propagation underlying it. We present in detail the facilities for specification of graph problems as subdefinite models. We discuss a class of graph problems with emphasizing on ones having not discussed before.

引用

页码：424 / 433

页数：10