Simplification method for bipartite graph and electronic toll collection system and opeartion method using the same

A simplification method for bipartite graphs includes the following steps. Firstly, a target bipartite graph, including first element set and second element set, is selected. Next, whether the first and the second element sets include a same number of element is determined; if not, whether the first...

Full description

Saved in:
Bibliographic Details
Main Authors JAN, RONG-HONG, HSU, KUO-HUANG, CHEN, CHIEN, LIN, LIANG-RUI
Format Patent
LanguageChinese
English
Published 01.07.2012
Subjects
CHECKING-DEVICES
FARE-REGISTERING APPARATUS
FRANKING APPARATUS
PHYSICS
TICKET-ISSUING APPARATUS
Online AccessGet full text

Cover

More Information
Summary:A simplification method for bipartite graphs includes the following steps. Firstly, a target bipartite graph, including first element set and second element set, is selected. Next, whether the first and the second element sets include a same number of element is determined; if not, whether the first and the second element sets respectively include one element and no element. If not, elements, with degree of 1, of the first or the second element sets are removed. Then whether the target bipartite graph after the element removal operation includes multiple sub-bipartite graphs is determined; if so, each of the sub-bipartite graphs is assigned as the target bipartite graph and the above mentioned steps are repeated. If not, whether the target bipartite graph is an empty set; if not, element identification operation is applied on the target bipartite graph to obtain at least an isolated element within the target bipartite graph.
Bibliography:Application Number: TW20100145067