Fast approximation of centrality.
Page 1
Eppstein, David, Wang, Joseph (2004)
Journal of Graph Algorithms and Applications
A. Aggarwal, B. Schieber, T. Tokuyama (1994)
Discrete & computational geometry
Nardelli, Enrico, Proietti, Guido, Widmayer, Peter (2001)
Journal of Graph Algorithms and Applications
Georgiadis, Loukas, Tarjan, Robert E., Werneck, Renato F. (2006)
Journal of Graph Algorithms and Applications
Simone Dantas, Celina M. H. de Figueiredo, Sylvain Gravier, Sulamita Klein (2005)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
We study the concept of an -partition of the vertex set of a graph , which includes all vertex partitioning problems into four parts which we require to be nonempty with only external constraints according to the structure of a model graph , with the exception of two cases, one that has already been classified as polynomial, and the other one remains unclassified. In the context of more general vertex-partition problems, the problems addressed in this paper have these properties: non-list, -part,...
Simone Dantas, Celina M.H. de Figueiredo, Sylvain Gravier, Sulamita Klein (2010)
RAIRO - Theoretical Informatics and Applications
We study the concept of an H-partition of the vertex set of a graph G, which includes all vertex partitioning problems into four parts which we require to be nonempty with only external constraints according to the structure of a model graph H, with the exception of two cases, one that has already been classified as polynomial, and the other one remains unclassified. In the context of more general vertex-partition problems, the problems addressed in this paper have these properties: non-list, 4-part, external...
Loh, Po-Shen (2003)
Journal of Graph Algorithms and Applications
Ivan Gutman, Dragoš Cvetković (1984)
Publications de l'Institut Mathématique
Jozef Zámožík, Mária Mišútová (1993)
Applications of Mathematics
The paper deals with the decomposition and with the boundarz and hull construction of the so-called nondense point set. This problem and its applications have been frequently studied in computational geometry, raster graphics and, in particular, in the image processing (see e.g. [3], [6], [7], [8], [9], [10]). We solve a problem of the point set decomposition by means of certain relations in graph theory.
Efrat, Alon, Erten, Cesim, Kobourov, Stephen (2007)
Journal of Graph Algorithms and Applications
J. Grabowski (1978)
Applicationes Mathematicae
Paule, Peter, Prodinger, Helmut (2003)
Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only]
Andreas Eisenblätter, Martin Grötschel, Arie M.C.A. Koster (2002)
Discussiones Mathematicae Graph Theory
This paper surveys frequency assignment problems coming up in planning wireless communication services. It particularly focuses on cellular mobile phone systems such as GSM, a technology that revolutionizes communication. Traditional vertex coloring provides a conceptual framework for the mathematical modeling of many frequency planning problems. This basic form, however, needs various extensions to cover technical and organizational side constraints. Among these ramifications are T-coloring and...
Closson, M., Gartshore, S., Johansen, J., Wismath, S.K. (2001)
Journal of Graph Algorithms and Applications
Page 1