Norishige Chiba
Tohoku University
Network
Latest external collaboration on country level. Dive into details by clicking on the dots.
Publication
Featured researches published by Norishige Chiba.
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 Algorithms | 1981
Norishige Chiba; Takao Nishizeki; Nobuji Saito
a(G)
Proceedings of the 17th Symposium of Research Institute of Electric Communication on Graph Theory and Algorithms | 1980
Norishige Chiba; Takao Nishizeki; Nobuji Saito
the arboricity of G. The second finds all the quadrangles in
Networks | 1983
Norishige Chiba; Takao Nishizeki; Nobuji Saito
O(a(G)m)
Archive | 1988
Norishige Chiba; Takao Nishizeki
time. Since
Archive | 1984
Norishige Chiba; Toru Yamanouchi; Takao Nishizeki
a(G)
Journal of Graph Theory | 1986
Norishige Chiba; 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
Archive | 1988
Takao Nishizeki; Norishige Chiba
K_l
