Search Results - "NISHIZEKI, Takao"

Bandwidth consecutive multicolorings of graphs by Nishikawa, Kazuhide, Nishizeki, Takao, Zhou, Xiao

“…Let G be a simple graph in which each vertex v has a positive integer weight b(v) and each edge (v, w) has a nonnegative integer weight b(v, w). A bandwidth…”
Get full text

Partitioning a graph of bounded tree-width to connected subgraphs of almost uniform size by Ito, Takehiro, Zhou, Xiao, Nishizeki, Takao

“…Assume that each vertex of a graph G is assigned a nonnegative integer weight and that l and u are nonnegative integers. One wishes to partition G into…”
Get full text

Algorithms for finding distance-edge-colorings of graphs by Ito, Takehiro, Kato, Akira, Zhou, Xiao, Nishizeki, Takao

“…For a bounded integer ℓ, we wish to color all edges of a graph G so that any two edges within distance ℓ have different colors. Such a coloring is called a…”
Get full text

Orthogonal Drawings of Plane Graphs Without Bends by Rahman, Md. Saidur, Nishizeki, Takao, Naznin, Mahmuda

Get full text

Multicolorings of series-parallel graphs by ZHOU, Xiao, NISHIZEKI, Takao

“…Let G be a graph, and let each vertex v of G have a positive integer weight ω(v). A multicoloring of G is to assign each vertex v a set of ω(v) colors so that…”
Get full text

Efficient approximation algorithms for bandwidth consecutive multicolorings of graphs by Obata, Yuji, Nishizeki, Takao

“…Let G be a graph in which each vertex v has a positive integer weight b(v) and each edge (v,w) has a nonnegative integer weight b(v,w). A bandwidth consecutive…”
Get full text

List total colorings of series-parallel graphs by Zhou, Xiao, Matsuo, Yuki, Nishizeki, Takao

“…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…”
Get full text

Characterization of optimal key set protocols by Mizuki, Takaaki, Shizuya, Hiroki, Nishizeki, Takao

“…Using a random deal of cards to players and a computationally unlimited eavesdropper, all players wish to share a common one-bit secret key which is…”
Get full text

Parametric power supply networks by Morishita, Shiho, Nishizeki, Takao

“…Suppose that each vertex of a graph G is either a supply vertex or a demand vertex and is assigned a supply or a demand. All demands and supplies are…”
Get full text

Algorithm for the cost edge-coloring of trees by XIAO ZHOU, NISHIZEKI, Takao

Get full text

Rectangular drawings of plane graphs without designated corners by Rahman, Md.Saidur, Nakano, Shin-ichi, Nishizeki, Takao

“…This paper addresses the problem of finding rectangular drawings of plane graphs, in which each vertex is drawn as a point, each edge is drawn as a horizontal…”
Get full text

A linear-time algorithm for four-partitioning four-connected planar graphs by Nakano, Shin-ichi, Rahman, Md.Saidur, Nishizeki, Takao

“…Given a graph G = ( V, E), four distinct vertices u 1, u 2, u 3, u 4 ϵ V and four natural numbers n 1, n 2, n 3, n 4 such that ∑ i = 1 4 ni = ¦V¦ , we wish to…”
Get full text

Size–energy tradeoffs for unate circuits computing symmetric Boolean functions by Uchizawa, Kei, Takimoto, Eiji, Nishizeki, Takao

“…A unate gate is a logical gate computing a unate Boolean function, which is monotone in each variable. Examples of unate gates are AND gates, OR gates, NOT…”
Get full text

Finding a noncrossing Steiner forest in plane graphs under a 2-face condition by KUSAKARI, Yoshiyuki, MASUBUCHI, Daisuke, NISHIZEKI, Takao

Get full text

Energy and depth of threshold circuits by Uchizawa, Kei, Nishizeki, Takao, Takimoto, Eiji

“…In this paper we show that there is a close relationship between the energy complexity and the depth of threshold circuits computing any Boolean function…”
Get full text

Minimum Cost Partitions of Trees with Supply and Demand by Ito, Takehiro, Hara, Takuya, Zhou, Xiao, Nishizeki, Takao

“…Let T be a given tree. Each vertex of T is either a supply vertex or a demand vertex, and is assigned a positive integer, called the supply or the demand…”
Get full text

Open Rectangle-of-Influence Drawings of Inner Triangulated Plane Graphs by Miura, Kazuyuki, Matsuno, Tetsuya, Nishizeki, Takao

“…A straight-line drawing of a plane graph is called an open rectangle-of-influence drawing if there is no vertex in the proper inside of the axis-parallel…”
Get full text

Minimum Cost Partitions of Trees with Supply and Demand: Algorithms and Computation by ITO, Takehiro, HARA, Takuya, XIAO ZHOU, NISHIZEKI, Takao

Get full text

Partitioning a Weighted Tree into Subtrees with Weights in a Given Range by Ito, Takehiro, Nishizeki, Takao, Schröder, Michael, Uno, Takeaki, Zhou, Xiao

“…Assume that each vertex of a graph G is assigned a nonnegative integer weight and that l and u are given integers such that 0≤ l ≤ u . One wishes to partition…”
Get full text

Small grid drawings of planar graphs with balanced partition by Zhou, Xiao, Hikino, Takashi, Nishizeki, Takao

“…In a grid drawing of a planar graph, every vertex is located at a grid point, and every edge is drawn as a straight-line segment without any edge-intersection…”
Get full text