The following pages link to Shigeru Masuyama (Q287106):
Displaying 27 items.
- A parallel algorithm for solving the coloring problem on trapezoid graphs (Q287107) (← links)
- Chain packing in graphs (Q808291) (← links)
- A proof of unimodality on the numbers of connected spanning subgraphs in an \(n\)-vertex graph with at least \(\left\lceil (3-2\sqrt 2) n^2 + n - \frac {7-2\sqrt 2}{2 \sqrt 2}\right\rceil\) edges (Q968184) (← links)
- On the tree packing problem (Q1183337) (← links)
- Deciding whether graph \(G\) has page number one is in NC (Q1195855) (← links)
- Edge-disjoint packings of graphs (Q1326750) (← links)
- On the equivalence in complexity among three computation problems on maximum number of edge-disjoint \(s\)-\(t\) paths in a probabilistic graph (Q1334642) (← links)
- A lower bound of the expected maximum number of edge-disjoint \(s\)--\(t\) paths on probabilistic graphs (Q1842649) (← links)
- Erratum and addendum to ``A linear time algorithm for finding all hinge vertices of a permutation graph'' (Q1944158) (← links)
- A polynomial time algorithm for obtaining minimum edge ranking on two-connected outerplanar graphs (Q2379975) (← links)
- (Q3125273) (← links)
- (Q3561694) (← links)
- (Q4243289) (← links)
- (Q4253341) (← links)
- A LOWER BOUND OF THE EXPECTED MAXIMUM NUMBER OF VERTEX-DISJOINT s-t PATHS ON PROBABILISTIC GRAPHS (Q4320147) (← links)
- (Q4331291) (← links)
- (Q4359806) (← links)
- (Q4376766) (← links)
- (Q4505361) (← links)
- (Q4548307) (← links)
- (Q4548321) (← links)
- (Q4703867) (← links)
- (Q4937185) (← links)
- (Q4937186) (← links)
- (Q4937201) (← links)
- (Q4937221) (← links)
- (Q4937877) (← links)
