Guan, M.G.: Graphic programming using odd or even points. Chinese Mathematics 1, 273-277 (1962) Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Graph Exploration - Assume We Are (Correct)
....we reach them. The goal is to explore G completely, i.e. draw a map of G. And we want to minimize the number of edge traversals. In the offline version of the problem we are asked to find a shortest tour visiting all edges (of length 1) of G. This problem is known as the Chinese Postman Problem [5]. It has polynomial time solutions for undirected graphs and directed graphs [3] but it is NP complete on mixed graphs with both undirected and directed edges [7] Theorem 1. On undirected graphs, no online algorithm can be better than 2 competitive, and DFS achieves this bound. Proof. Assume G ....
M.-K. Kwan. Graphic programming using odd or even points. Chinese Journal of Mathematics, 1(1):273--277, 1962.
Efficient Algorithms for Constructing Testing Sets, Covering.. - Aho, Lee (1987) (1 citation) (Correct)
....positive circulation problems by C i (1) i = 1 , 2 , 3. Let G O be a directed graph with origin O. A closed path in G O is one in which the beginning and the ending vertex is the same origin O. A postman tour is a closed path that uses every edge at least once in the direction of the edges [Kwan, 1960; Edmonds and Johnson, 1973] Similar to the covering paths problems CP i (1) i = 1 , 2 , 3, we can define the following postman tour problems on G O : Problem PT 1 (1) Least repetitious postman tour. Find a postman tour with minimum repetition. Problem PT 2 (1) Minimum cost ....
....j) can be solved in time O(mn) j = 1 , 2. The positive circulation and the postman tour problems C i ( j) and PT i ( j) i = 2 , 3 , can be solved in time O(m(m n log n) if j = 1, and in time O(n(m n log n) log(m n) if j = 2. Problem PT 3 (2) is the classical Chinese postman problem [Kwan, 1960]. Balancing was used to reduce the problem to a minimum cost maximum flow problem on a balancing graph [Gibbons, 1985] and the previously best known algorithm ran in time O(mn log n) Gabow and Tarjan, 1987] From Lemma 5.3 and Theorem 7.1, our algorithm runs in time O(n(m nlogn) log(m n) ....
Kwan, M. (Guan, Meigu) [1960]. Graphic programming using odd or even points, Chinese Math. 1, 273277.
Cycle cover property and CPP = SCC property are not equivalent - Rizzi (2002) (Correct)
No context found.
Guan, M.G.: Graphic programming using odd or even points. Chinese Mathematics 1, 273-277 (1962)
Sequence Database Compression for Peptide Identification.. - Edwards, Lippert (2004) (Correct)
No context found.
Kwan, M.K.: Graphic programming using odd or even points. Chinese Mathematics 1 (1962) 273--277
Sensor Planning and Bayesian Network Structure Learning for - Mobile Robot Localization (Correct)
No context found.
M.Kwan, \Graphic Programming using ODD or EVEN Points", Chinese Math, 1, pp.273-277, 1996.
Sequence Database Compression for Peptide Identification.. - Edwards, Lippert (2004) (Correct)
No context found.
Kwan, M.K.: Graphic programming using odd or even points. Chinese Mathematics 1 (1962) 273--277
Postman Problems on Mixed Graphs - Mart (2003) (Correct)
No context found.
M. G. Guan. Graphic programming using odd or even points. Chinese Math., 1:273-- 277, 1960.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC