Keyword : polynomial-time algorithms


Extracting Minimal Siphon-Traps of Petri Nets and Its Application to Computing Nonnegative Integer-Invariants
Satoshi TAOKA Katsushi TAKANO Toshimasa WATANABE 
Publication:   IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 2002/11/01
Vol. E85-A  No. 11 ; pp. 2436-2446
Type of Manuscript:  Special Section PAPER (Special Section on Concurrent System Technology and Its Application to Multiple Agent Systems)
Category: 
Keyword: 
Petri netminimal siphon-trapsFourier-Motzkin methodinvariant computationpolynomial-time algorithms
 Summary | Full Text:PDF(489.7KB)

Finding a Minimal Siphon Containing Specified Places in a General Petri Net
Masahiro YAMAUCHI Shinji TANIMOTO Toshimasa WATANABE 
Publication:   IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 1996/11/25
Vol. E79-A  No. 11 ; pp. 1825-1828
Type of Manuscript:  Special Section LETTER (Special Section on Description Models for Concurrent Systems and Their Applications)
Category: 
Keyword: 
general Petri netsminimal siphonspolynomial-time algorithmsstrongly connectedneddNP-completeness
 Summary | Full Text:PDF(334.6KB)

Finding Minimal Siphons in General Petri Nets
Shinji TANIMOTO Masahiro YAMAUCHI Toshimasa WATANABE 
Publication:   IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 1996/11/25
Vol. E79-A  No. 11 ; pp. 1817-1824
Type of Manuscript:  Special Section PAPER (Special Section on Description Models for Concurrent Systems and Their Applications)
Category: 
Keyword: 
general Petri netsminimal siphonspolynomial-time algorithmsstrongly connectednessNP-completeness
 Summary | Full Text:PDF(616.4KB)

Computing k-Edge-Connected Components of a Multigraph
Hiroshi NAGAMOCHI Toshimasa WATANABE 
Publication:   IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 1993/04/25
Vol. E76-A  No. 4 ; pp. 513-517
Type of Manuscript:  Special Section PAPER (Special Section on Discrete Mathematics and Its Applications)
Category: 
Keyword: 
design of algorithm, computational complexitymultigraphsedge-connectivityconnected componetsmaximum flowsminimum cutspolynomial-time algorithms
 Summary | Full Text:PDF(437.9KB)