Author of the publication

A Lower Bound of the Expected Maximum Number of Edge-disjoint S-t Paths on Probabilistic Graphs.

, and . Discret. Appl. Math., 56 (2-3): 137-155 (1995)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Formulas for Counting the Numbers of Connected Spanning Subgraphs with at Most n+1 Edges in a Complete Graph Kn., and . IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 91-A (9): 2314-2321 (2008)Performance Evaluation of Prioritized Token Ring Protocols, , , and . page 3.1-3.7. (1985)A proof of unimodality on the numbers of connected spanning subgraphs in an n-vertex graph with at least ... edges., and . Discret. Appl. Math., 158 (6): 608-619 (2010)On the tree packing problem.. Discret. Appl. Math., 35 (2): 163-166 (1992)Extraction of Cause Information from Newspaper Articles Concerning Business Performance., and . AIAI, volume 247 of IFIP, page 205-212. Springer, (2007)Unsupervised Acquisition of Knowledge about the Abbreviation Possibility of some of Multiple Phrases modifying the same Verb/Noun., and . NTCIR, National Institute of Informatics (NII), (2002)NTCIR-8 Patent Mining Task at Toyohashi University of Technology., , , , , and . NTCIR, page 364-369. National Institute of Informatics (NII), (2010)Extracting Causal Knowledge Using Clue Phrases and Syntactic Patterns., , and . PAKM, volume 5345 of Lecture Notes in Computer Science, page 111-122. Springer, (2008)Shortest Semijoin Schedule for a Local Area Distributed Database System., , , and . IEEE Trans. Software Eng., 13 (5): 602-606 (1987)Yet Another Summarization System with Two Modules using Empirical Knowledge., , , and . NTCIR, National Institute of Informatics (NII), (2001)