Map Middle East, 2005, 5. — 7 p. A common method for reconstruction of a geometric figure for a given point set is the use of a triangulation algorithm to connect the points. Triangulation a set of sample points is an important method with many applications. There are some algorithms for triangulating a point set in two or three dimensions, but just few of them can solve the...
Advances in Engineering Software. — 1987. — Vol. 9. — No. 1. — p. 34-55. This paper describes an algorithm for computing Delaunay triangulations of arbitrary collections of points in the plane. A Fortran 77 implementation of the scheme is given. For N points distributed randomly within a square domain, the expected run time for the algorithm is approximately 0(NS/4). Empirical...
Сборник статей. — Киев: Институт математики АН УССР, 1971. — 310 с. Значительная часть работ, помещенных в настоящем сборнике, посвящена исследованию топологических свойств графов, главным образом, вопросу вложения графов в 2-многообразия. В сборнике представлены работы , относящиеся к исследованию связности и анализу структуры графов по некоторым их характеристикам....
Graph Theory and Topology in Chemistry: A Collection of Papers Presented at an International Conference Held at the University of Georgia, Athens, Georgia, U.S. A., 16-20 March 1987, (Studies in Physical and Theoretical Chemistry, Vol. 51), Elsevier: Amsterdam, 1987. ISBN: 0-444-42882-8. Knot Theory and Reaction Topology. Sumners D.W. Knots, Macromolecules and Chemical...
Article. — Proceedings of the National Academy of Sciences (PNAS). — 2008. — vol. 105. — №4. — p. 62 To comprehend the multipartite organization of large-scale biological and social systems, we introduce an information theoretic approach that reveals community structure in weighted and directed networks. We use the probability flow of random walks on a network as a proxy for...
Article. — KDD-96: Proceedings of the Second International Conference on Knowledge Discovery and Data Mining. — August 1996. — p. 226-231. Clustering algorithms are attractive for the task of class identification in spatial databases. However, the application to large spatial databases rises the following requirements for clustering algorithms: minimal requirements of domain...
The article, Communications of the ACM, vol. 64, NO. 9, 09.2021, 62 - 71 p. We are witnessing an unprecedented growth of interconnected data, which underscores the vital role of graph processing in our society. Instead of a single, exemplary (“killer”) application, we see a big graph processing system underpinning many emerging but already complex and diverse data management...
Scientific Article. - Nature Physics. - 2019 - 15(4): 313-320 p. Network science seeks to connect the structure, dynamics, and function of complex systems. The nodes and links in network models represent a system’s components and their direct pairwise interactions. Principal network science methods – including community detection, node ranking, and the modelling of dynamical...
Статья. — Труды МФТИ. — 2011 — Том 3, № 4. — С. 127-139. Комбинаторная геометрия — это очень современная и бурно развивающаяся наука, находящаяся на стыке геометрии и дискретного анализа. Основные задачи комбинаторной геометрии состоят в изучении комбинаторных свойств различных совокупностей геометрических объектов. В самостоятельную дисциплину, богатую красивыми и трудными...
Article. — Combinatorica. — 14 (1993). — pp. 279–361. In 1943, Hadwiger made the conjecture that every loopless graph not contractible to the complete graph on t + 1 vertices is t -colourable. When t ≤ 3 this is easy, and when t = 4, Wagner’s theorem of 1937 shows the conjecture to be equivalent to the four-colour conjecture (the 4CC). However, when t ≥ 5 it has remained open....
Department of Mathematics and Statistics University of Minnesota Duluth Duluth, Minnesota 55812, U.S.A.
Submitted: September 1, 1996; Accepted: November 14, 1997 Seventeenth edition, December 29, 2014 Mathematics Subject Classifications: 05C78
A graph labeling is an assignment of integers to the vertices or edges, or both, subject to certain conditions. Graph labelings were...
Издательство North-Holland, 1989, -267 pp.
Graph coloring has been a field of attraction for many years; a wide collection of papers has been dedicated to the study of chromatic properties of graphs. Initially such problems were just a kind of game for pure mathematicians; it was in particular the case of the famous four color problem. However, as people were getting used to...
Издательство North-Holland, 1989, -267 pp.
Graph coloring has been a field of attraction for many years; a wide collection of papers has been dedicated to the study of chromatic properties of graphs. Initially such problems were just a kind of game for pure mathematicians; it was in particular the case of the famous four color problem. However, as people were getting used to...
Комментарии