A note on dual trail partition of a plane graph

0.00 Avg rating—0 Votes

Article ID:	iaor19921445
Country:	Japan
Volume:	E74-A
Issue:	7
Start Page Number:	1915
End Page Number:	1917
Publication Date:	Jul 1991
Journal:	Transactions of the Institute of Electronics, Information and Communication Engineers
Authors:	Ueno Shuichi, Tsuji Katsufumi, Kajitani Yoji
Keywords:	computational analysis

Abstract:

Given a plane graph G, a trail of G is said to be dual if it is also a trail in the geometric dual of G. The authors show that the problem of partitioning the edges of G into the minimum number of dual trails is NP-hard.

Reviews

Required fields are marked *. Your email address will not be published.