Takao Nishizeki
Kwansei Gakuin University
Network
Latest external collaboration on country level. Dive into details by clicking on the dots.
Publication
Featured researches published by Takao Nishizeki.
SIAM Journal on Computing | 1985
Norishige Chiba; Takao Nishizeki
In this paper we introduce a new simple strategy into edge-searching of a graph, which is useful to the various subgraph listing problems. Applying the strategy, we obtain the following four algorithms. The first one lists all the triangles in a graph G in
Journal of Computer and System Sciences | 1985
Norishige Chiba; Takao Nishizeki; Shigenobu Abe; Takao Ozawa
O(a(G)m)
Acta Informatica | 1985
Norishige Chiba; Kazunori Onoguchi; Takao Nishizeki
time, where m is the number of edges of G and
Journal of Cryptology | 1993
Mitsuru Ito; Akira Saito; Takao Nishizeki
a(G)
Journal of Algorithms | 1989
Norishige Chiba; Takao Nishizeki
the arboricity of G. The second finds all the quadrangles in
SIAM Journal on Discrete Mathematics | 1990
Takao Nishizeki; Kenichi Kashiwagi
O(a(G)m)
Discrete Applied Mathematics | 1992
András Frank; Takao Nishizeki; Nobuji Saito; Hitoshi Suzuki; Éva Tardos
time. Since
Discrete Applied Mathematics | 2001
Takao Nishizeki; Jens Vygen; Xiao Zhou
a(G)
Discrete and Computational Geometry | 2001
Kazuyuki Miura; Shin-ichi Nakano; Takao Nishizeki
is at most three for a planar graph G, both run in linear time for a planar graph. The third lists all the complete subgraphs
Computational Geometry: Theory and Applications | 1998
Md. Saidur Rahman; Shin-ichi Nakano; Takao Nishizeki
K_l
Collaboration
Dive into the Takao Nishizeki's collaboration.
