E-LIB Suche - Ergebnisse für: Nishizeki, T

1

Improvements of HITS Algorithms for Spam Links:

ASANO, Y. ; TEZUKA, Y. ; NISHIZEKI, T.
IEICE Transactions on Information and Systems. E91-D (2008) 2 - p. 200-208 , 2008

Link: https://doi.org/10.1093/..

2

Sufficient Condition and Algorithm for List Total Colorings..:

MATSUO, Y. ; ZHOU, X. ; NISHIZEKI, T.
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences. E90-A (2007) 5 - p. 907-916 , 2007

Link: https://doi.org/10.1093/..

3

Partitioning a Multi-Weighted Graph to Connected Subgraphs ..:

ITO, T. ; GOTO, K. ; ZHOU, X..
IEICE Transactions on Information and Systems. E90-D (2007) 2 - p. 449-456 , 2007

Link: https://doi.org/10.1093/..

4

Mining Communities on the Web Using a Max-Flow and a Site-O..:

ASANO, Y. ; NISHIZEKI, T. ; TOYODA, M..
IEICE Transactions on Information and Systems. E89-D (2006) 10 - p. 2606-2615 , 2006

Link: https://doi.org/10.1093/..

5

Grid Drawings of 4-Connected Plane Graphs:

Miura, K. ; Nakano, S. ; Nishizeki, T.
Discrete & Computational Geometry. 26 (2001) 1 - p. 73-87 , 2001

Link: https://doi.org/10.1007/..

6

Gurafu riron nyūmon: gensho dai 3-han = Introduction to gra..:

Wilson, Robin J ; Nishizeki, T ; Nishizeki, Yūko - Shohan . , 2001

Link: https://search.ebscohost..

7

Finding Edge-Disjoint Paths in Partial k -Trees:

Zhou, X. ; Tamura, S. ; Nishizeki, T.
Algorithmica. 26 (2000) 1 - p. 3-30 , 2000

Link: https://doi.org/10.1007/..

8

Foreword:

Nishizeki, T. ; Tamassia, R. ; Wagner, D.
Algorithmica. 26 (2000) 1 - p. 1-2 , 2000

Link: https://doi.org/10.1007/..

9

A Linear Algorithm for Finding \boldmath[{ g,f }]-Colorings..:

Fuse, K. ; Zhou, X. ; Nishizeki, T.
Algorithmica. 27 (2000) 3 - p. 227-243 , 2000

Link: https://doi.org/10.1007/..

10

On thefg-coloring of graphs:

Nakano, S. ; Nishizeki, T. ; Saito, N.
Combinatorica. 10 (1990) 1 - p. 67-80 , 1990

Link: https://doi.org/10.1007/..

11

Discrete Algorithms and Complexity: Proceedings of the Japa..

Perspectives in computing, vol. 15

Johnson, David S ; Nishizeki, T ; Nozaki, Akihiro. , 1987

Link: https://search.ebscohost..

12

Multicommodity flows in planar undirected graphs and shorte..:

, In: Proceedings of the seventeenth annual ACM symposium on Theory of computing,

Suzuki, H ; Nishizeki, T ; Saito, N - p. 195-204 , 1985

Link: https://dl.acm.org/doi/1..

13

Linear-time computability of combinatorial problems on seri..:

Takamizawa, K. ; Nishizeki, T. ; Saito, N.
Journal of the ACM (JACM). 29 (1982) 3 - p. 623-641 , 1982

Link: https://dl.acm.org/doi/1..

14

Linear-time computability of combinatorial problems on seri..:

Takamizawa, K. ; Nishizeki, T. ; Saito, N.
Journal of the ACM. 29 (1982) 3 - p. 623-641 , 1982

Link: https://doi.org/10.1145/..

15

Graph Theory and Algorithms

17th Symposium of Research Institute of Electrical Communic... Lecture Notes in Computer Science ; 108;SpringerLink, Bücher

Saito, N. ; Nishizeki, T. , 1981

Link: https://doi.org/10.1007/..