Takao Nishizeki - Academia.edu (original) (raw)
Papers by Takao Nishizeki
A total coloring of a graph G is a coloring of all elements of G, i.e. vertices and edges, in suc... more A total coloring of a graph G is a coloring of all elements of G, i.e. vertices and edges, in such a way that no two adjacent or incident elements receive the same color. The total coloring problem is to find a total coloring of a given graph with the minimum number of colors. Many combinatorial problems can be efficiently solved for partial k-trees, i.e., graphs with bounded tree-width. However, no efficient algorithm has been known for the total coloring problem on partial k-trees although a polynomial-time algorithm of very high order has been known. In this paper, we give a linear-time algorithm for the total coloring problem on partial k-trees with bounded.
Several methods have been proposed for compressing the linkage data of a Web graph. Among them, t... more Several methods have been proposed for compressing the linkage data of a Web graph. Among them, the method proposed by Boldi and Vigna is known as the most efficient one. In the paper, we propose a new method to compress a Web graph. Our method is more efficient than theirs with respect to the size of the compressed data. For example, our method needs only 1.99 bits per link to compress a Web graph containing 3,216,152 links connecting 325,557 pages, while the method of Boldi and Vigna needs 2.84 bits per link to compress the same Web graph.
A canonical decomposition, a realizer, a Schnyder labeling and an orderly spanning tree of a plan... more A canonical decomposition, a realizer, a Schnyder labeling and an orderly spanning tree of a plane graph play an important role in straight-line grid drawings, convex grid drawings, floor-plannings, graph encoding, etc. It is known that the triconnectivity is a sufficient condition for their existence, but no necessary and sufficient condition has been known. In this paper, we present a necessary and sufficient condition for their existence, and show that a canonical decomposition, a realizer, a Schnyder labeling, an orderly spanning tree, and an outer triangular convex grid drawing are notions equivalent with each other. We also show that they can be found in linear time whenever a plane graph satisfies the condition.
Assume that each edge e of a graph G is assigned a list (set) L(e) of colors. Then an edge-colori... more Assume that each edge e of a graph G is assigned a list (set) L(e) of colors. Then an edge-coloring of G is called an L-edge-coloring if each edge e of G is colored with a color contained in L(e). In this paper, we prove that any series-parallel simple graph G has an L-edge-coloring if |L(e)| ≥ max{3, d(v), d(w)} for each edge e = vw, where d(v) and d(w) are the degrees of the ends v and w of e, respectively. Our proof yields a linear algorithm for finding an L-edge-coloring of series-parallel graphs. key words: algorithm, list edge-coloring, series-parallel graph
あらまし 辺容量付き電力需給ネットワークはグラフ G で表現できる.G の各点は供給点あるいは需要点で あり,供給量あるいは需要量が割当てられており,各辺には辺容量が割当てられている.パラメトリ... more あらまし 辺容量付き電力需給ネットワークはグラフ G で表現できる.G の各点は供給点あるいは需要点で あり,供給量あるいは需要量が割当てられており,各辺には辺容量が割当てられている.パラメトリックネット ワークでは,供給量,需要量及び辺容量は変数 λ の関数である.各需要点は,丁度一つの供給点からグラフ G の辺を通してその需要量だけの “電力” を受け取りたい.一方,各供給点は,幾つかの需要点へ G の辺を通して “電力”を送ることができるが,送る電力の合計はその供給量以下である.無論各辺を流れる電力フローはその辺 の容量以下でなければならない.このようなことが可能かどうか調べたい.また不可能ならば,全ての需要量を 一様に r(0 ≤ r < 1) 倍に減少させて,そのようなことを可能にしたい.このような r の最大値 r∗ を求めたい. 本論文では,木であるグラフ G に対してこれらの問題を解くアルゴリズムを与える. キーワード アルゴリズム,木,最大供給率問題,パラメトリックネットワーク,分割問題
A rectangle-of-influence drawing of a plane graph G is a straight-line planar drawing of G such t... more A rectangle-of-influence drawing of a plane graph G is a straight-line planar drawing of G such that there is no vertex in the proper inside of the axis-parallel rectangle defined by the two ends of any edge. In this paper, we show that any 4-connected plane graph G with four or more vertices on the outer face has a rectangle-of-influence drawing in an integer grid such that W + H ≤ n, where n is the number of vertices in G, W is the width and H is the height of the grid. Thus the area W x H of the grid is at most [(n-1)/2] [(n-1)/2]. Our bounds on the grid sizes are optimal in a sense that there exist an infinite number of 4-connected plane graphs whose drawings need grids such that W + H = n - 1 and W x H = [(n-1)/2]. [(n-1)/2]. We also show that the drawing can be found in linear time.
Theoretical Computer Science - TCS, 2000
A c-vertex-ranking of a graph G for a positive integer c is a labeling of the vertices of G with ... more A c-vertex-ranking of a graph G for a positive integer c is a labeling of the vertices of G with integers such that, for any label i, deletion of all vertices with labels >i leaves connected components, each having at most c vertices with label i. A c-vertex-ranking is optimal if the number of labels used is as small as possible. We present sequential and parallel algorithms to find an optimal c-vertex-ranking of a partial k-tree, that is, a graph of treewidth bounded by a fixed integer k. The sequential algorithm takes polynomial-time for any positive integer c. The parallel algorithm takes O(logn) parallel time using a polynomial number of processors on the common CRCW PRAM, where n is the number of vertices in G.
Electronics and Communications in Japan (Part III: Fundamental Electronic Science)
Assume that G is an undirected planar graph and the edge length of G is a nonnegative real number... more Assume that G is an undirected planar graph and the edge length of G is a nonnegative real number. When k terminal pairs are specified on two specified face boundaries, this paper gives an algorithm that derives the "noncrossing paths" with the minimum sum of lengths that connects the respective terminal pairs. By the noncrossing paths is meant the paths which do not cross on the plane, although the point or the edge may be shared. The computation time of the proposed algorithm is O(n log n), where n is the number of points on the planar graph 0, k need not be a constant.
SIAM Journal on Computing
MULTICOMMODITY FLOWS IN PLANAR NETWORKS 301 We now have the following theorem. Theorem 2. Algorit... more MULTICOMMODITY FLOWS IN PLANAR NETWORKS 301 We now have the following theorem. Theorem 2. Algorithm MULTIFLÓW correctly finds multiconunodity flows of given demands in a pianar network N = {G,P,c) if all the sources and sinks are on the boundary of the ...
IEEE Transactions on Circuits and Systems
Electronics and Communications in Japan (Part III: Fundamental Electronic Science)
IEEE Transactions on Circuits and Systems
ABSTRACT
Lecture Notes in Computer Science, 1999
Using a random deal of cards to players and a computationally unlimited eavesdropper, all players... more Using a random deal of cards to players and a computationally unlimited eavesdropper, all players wish to share a one-bit secret key which is information-theoretically secure from the eavesdropper. This can be done by a protocol to make several pairs of players share one-bit secret keys so that all these pairs form a spanning tree over players. In this paper we obtain a necessary and sufficient condition on the number of cards for the existence of such a protocol. Our condition immediately yields an efficient linear-time algorithm to determine whether there exists a protocol to achieve such a secret key sharing.
Ieice Transactions on Fundamentals of Electronics Communications and Computer Sciences, Jan 25, 1995
SUMMARY Graph drawing addresses the problem of constructing ge-ometric representation of informat... more SUMMARY Graph drawing addresses the problem of constructing ge-ometric representation of information and finds applications in almost ev-ery branch of science and technology. Efficient algorithms are essential for automatic drawings of graphs, and hence a lot of research ...
Lecture Notes in Computer Science, 2002
In a rectangular drawing of a plane graph, each edge is drawn as a horizontal or vertical line se... more In a rectangular drawing of a plane graph, each edge is drawn as a horizontal or vertical line segment, and all faces including the outer face are drawn as rectangles. In this paper, we introduce an "extended rectangular drawing" in which all inner faces are drawn as rectangles but the outer face is drawn as a rectilinear polygon with designated corners, and give a necessary and sufficient condition for a plane graph to have an extended rectangular drawing.
Lecture Notes in Computer Science, 2002
ABSTRACT
A total coloring of a graph G is a coloring of all elements of G, i.e. vertices and edges, in suc... more A total coloring of a graph G is a coloring of all elements of G, i.e. vertices and edges, in such a way that no two adjacent or incident elements receive the same color. The total coloring problem is to find a total coloring of a given graph with the minimum number of colors. Many combinatorial problems can be efficiently solved for partial k-trees, i.e., graphs with bounded tree-width. However, no efficient algorithm has been known for the total coloring problem on partial k-trees although a polynomial-time algorithm of very high order has been known. In this paper, we give a linear-time algorithm for the total coloring problem on partial k-trees with bounded.
Several methods have been proposed for compressing the linkage data of a Web graph. Among them, t... more Several methods have been proposed for compressing the linkage data of a Web graph. Among them, the method proposed by Boldi and Vigna is known as the most efficient one. In the paper, we propose a new method to compress a Web graph. Our method is more efficient than theirs with respect to the size of the compressed data. For example, our method needs only 1.99 bits per link to compress a Web graph containing 3,216,152 links connecting 325,557 pages, while the method of Boldi and Vigna needs 2.84 bits per link to compress the same Web graph.
A canonical decomposition, a realizer, a Schnyder labeling and an orderly spanning tree of a plan... more A canonical decomposition, a realizer, a Schnyder labeling and an orderly spanning tree of a plane graph play an important role in straight-line grid drawings, convex grid drawings, floor-plannings, graph encoding, etc. It is known that the triconnectivity is a sufficient condition for their existence, but no necessary and sufficient condition has been known. In this paper, we present a necessary and sufficient condition for their existence, and show that a canonical decomposition, a realizer, a Schnyder labeling, an orderly spanning tree, and an outer triangular convex grid drawing are notions equivalent with each other. We also show that they can be found in linear time whenever a plane graph satisfies the condition.
Assume that each edge e of a graph G is assigned a list (set) L(e) of colors. Then an edge-colori... more Assume that each edge e of a graph G is assigned a list (set) L(e) of colors. Then an edge-coloring of G is called an L-edge-coloring if each edge e of G is colored with a color contained in L(e). In this paper, we prove that any series-parallel simple graph G has an L-edge-coloring if |L(e)| ≥ max{3, d(v), d(w)} for each edge e = vw, where d(v) and d(w) are the degrees of the ends v and w of e, respectively. Our proof yields a linear algorithm for finding an L-edge-coloring of series-parallel graphs. key words: algorithm, list edge-coloring, series-parallel graph
あらまし 辺容量付き電力需給ネットワークはグラフ G で表現できる.G の各点は供給点あるいは需要点で あり,供給量あるいは需要量が割当てられており,各辺には辺容量が割当てられている.パラメトリ... more あらまし 辺容量付き電力需給ネットワークはグラフ G で表現できる.G の各点は供給点あるいは需要点で あり,供給量あるいは需要量が割当てられており,各辺には辺容量が割当てられている.パラメトリックネット ワークでは,供給量,需要量及び辺容量は変数 λ の関数である.各需要点は,丁度一つの供給点からグラフ G の辺を通してその需要量だけの “電力” を受け取りたい.一方,各供給点は,幾つかの需要点へ G の辺を通して “電力”を送ることができるが,送る電力の合計はその供給量以下である.無論各辺を流れる電力フローはその辺 の容量以下でなければならない.このようなことが可能かどうか調べたい.また不可能ならば,全ての需要量を 一様に r(0 ≤ r < 1) 倍に減少させて,そのようなことを可能にしたい.このような r の最大値 r∗ を求めたい. 本論文では,木であるグラフ G に対してこれらの問題を解くアルゴリズムを与える. キーワード アルゴリズム,木,最大供給率問題,パラメトリックネットワーク,分割問題
A rectangle-of-influence drawing of a plane graph G is a straight-line planar drawing of G such t... more A rectangle-of-influence drawing of a plane graph G is a straight-line planar drawing of G such that there is no vertex in the proper inside of the axis-parallel rectangle defined by the two ends of any edge. In this paper, we show that any 4-connected plane graph G with four or more vertices on the outer face has a rectangle-of-influence drawing in an integer grid such that W + H ≤ n, where n is the number of vertices in G, W is the width and H is the height of the grid. Thus the area W x H of the grid is at most [(n-1)/2] [(n-1)/2]. Our bounds on the grid sizes are optimal in a sense that there exist an infinite number of 4-connected plane graphs whose drawings need grids such that W + H = n - 1 and W x H = [(n-1)/2]. [(n-1)/2]. We also show that the drawing can be found in linear time.
Theoretical Computer Science - TCS, 2000
A c-vertex-ranking of a graph G for a positive integer c is a labeling of the vertices of G with ... more A c-vertex-ranking of a graph G for a positive integer c is a labeling of the vertices of G with integers such that, for any label i, deletion of all vertices with labels >i leaves connected components, each having at most c vertices with label i. A c-vertex-ranking is optimal if the number of labels used is as small as possible. We present sequential and parallel algorithms to find an optimal c-vertex-ranking of a partial k-tree, that is, a graph of treewidth bounded by a fixed integer k. The sequential algorithm takes polynomial-time for any positive integer c. The parallel algorithm takes O(logn) parallel time using a polynomial number of processors on the common CRCW PRAM, where n is the number of vertices in G.
Electronics and Communications in Japan (Part III: Fundamental Electronic Science)
Assume that G is an undirected planar graph and the edge length of G is a nonnegative real number... more Assume that G is an undirected planar graph and the edge length of G is a nonnegative real number. When k terminal pairs are specified on two specified face boundaries, this paper gives an algorithm that derives the "noncrossing paths" with the minimum sum of lengths that connects the respective terminal pairs. By the noncrossing paths is meant the paths which do not cross on the plane, although the point or the edge may be shared. The computation time of the proposed algorithm is O(n log n), where n is the number of points on the planar graph 0, k need not be a constant.
SIAM Journal on Computing
MULTICOMMODITY FLOWS IN PLANAR NETWORKS 301 We now have the following theorem. Theorem 2. Algorit... more MULTICOMMODITY FLOWS IN PLANAR NETWORKS 301 We now have the following theorem. Theorem 2. Algorithm MULTIFLÓW correctly finds multiconunodity flows of given demands in a pianar network N = {G,P,c) if all the sources and sinks are on the boundary of the ...
IEEE Transactions on Circuits and Systems
Electronics and Communications in Japan (Part III: Fundamental Electronic Science)
IEEE Transactions on Circuits and Systems
ABSTRACT
Lecture Notes in Computer Science, 1999
Using a random deal of cards to players and a computationally unlimited eavesdropper, all players... more Using a random deal of cards to players and a computationally unlimited eavesdropper, all players wish to share a one-bit secret key which is information-theoretically secure from the eavesdropper. This can be done by a protocol to make several pairs of players share one-bit secret keys so that all these pairs form a spanning tree over players. In this paper we obtain a necessary and sufficient condition on the number of cards for the existence of such a protocol. Our condition immediately yields an efficient linear-time algorithm to determine whether there exists a protocol to achieve such a secret key sharing.
Ieice Transactions on Fundamentals of Electronics Communications and Computer Sciences, Jan 25, 1995
SUMMARY Graph drawing addresses the problem of constructing ge-ometric representation of informat... more SUMMARY Graph drawing addresses the problem of constructing ge-ometric representation of information and finds applications in almost ev-ery branch of science and technology. Efficient algorithms are essential for automatic drawings of graphs, and hence a lot of research ...
Lecture Notes in Computer Science, 2002
In a rectangular drawing of a plane graph, each edge is drawn as a horizontal or vertical line se... more In a rectangular drawing of a plane graph, each edge is drawn as a horizontal or vertical line segment, and all faces including the outer face are drawn as rectangles. In this paper, we introduce an "extended rectangular drawing" in which all inner faces are drawn as rectangles but the outer face is drawn as a rectilinear polygon with designated corners, and give a necessary and sufficient condition for a plane graph to have an extended rectangular drawing.
Lecture Notes in Computer Science, 2002
ABSTRACT