Art
J-GLOBAL ID：201502248856992749   Reference number：15A0408355

The Complexity of Bounded Length Graph Recoloring and CSP Reconfiguration

有限長グラフ再彩色とCSP(制約充足問題)再構成の複雑性
Author (4)：
BONSMA Paul

About BONSMA Paul

(Univ. Twente, Enschede, NLD)

About Univ. Twente, Enschede, NLD

, 
MOUAWAD Amer E.

About MOUAWAD Amer E.

(Univ. Waterloo, Waterloo, CAN)

About Univ. Waterloo, Waterloo, CAN

, 
NISHIMURA Naomi

About NISHIMURA Naomi

(Univ. Waterloo, Waterloo, CAN)

About Univ. Waterloo, Waterloo, CAN

, 
RAMAN Venkatesh

About RAMAN Venkatesh

(Inst. of Mathematical Sci., Chennai, IND)

About Inst. of Mathematical Sci., Chennai, IND


Material：
Lecture Notes in Computer Science  (LNBI)

About Lecture Notes in Computer Science


Volume： 8894  Page： 110-121  Publication year： 2014 
JST Material Number： H0078D  ISSN： 0302-9743  Document type： Proceedings
Country of issue： Germany, Federal Republic of (DEU)  Language： ENGLISH (EN)
Terms in the title (6)：
Terms in the title
Keywords automatically extracted from the title.
グラフ

About グラフ

, 
彩色

About 彩色

, 
CSP

About CSP

, 
制約充足問題

About 制約充足問題

, 
再構成

About 再構成

, 
複雑性

About 複雑性


Return to Previous Page

TOP

BOTTOM