Masuda Sumio

Sumio Masuda

Information about the author Sumio Masuda will soon be added to the site.
Found 5 papers in total
The maximum-weight-window problem of a planar graph
The maximum-weight-window problem of a planar graph
1995
An undirected graph is called a planar graph if it can be drawn on a plane without the...
An efficient algorithm for drawing tree structured diagrams
An efficient algorithm for drawing tree structured diagrams
1996
Various algorithms have been proposed for the problem of drawing rooted ordered trees....
An algorithm for embedding a biconnected planar graph to maximize the total sum of vertex- and edge-weights on the exterior window
An algorithm for embedding a biconnected planar graph to maximize the total sum of vertex- and edge-weights on the exterior window
1991
Let G=(V,E) be a biconnected planar graph whose vertices and edges have weights. This...
An algorithm for testing the planarity of a hierarchical graph
An algorithm for testing the planarity of a hierarchical graph
1991
Suppose a graph G=(V,E ) is given and a partition of V into K subsets V 1 ,V 2 ,...,V...
Permutation layout with the minimum number of crossings between wires and the lower horizontal line
Permutation layout with the minimum number of crossings between wires and the lower horizontal line
1989
Suppose that two sets of terminals t 1 ,t 2 ,...,t m and b 1 ,b 2 ,...,b m are located...
Papers per page: