Graph representation learning: a survey
Research on graph representation learning has received great attention in recent years
since most data in real-world applications come in the form of graphs. High-dimensional …
since most data in real-world applications come in the form of graphs. High-dimensional …
[图书][B] The algorithm design manual
SS Skiena - 1998 - Springer
This newly expanded and updated second edition of the best-selling classic continues to
take the" mystery" out of designing algorithms, and analyzing their efficacy and efficiency …
take the" mystery" out of designing algorithms, and analyzing their efficacy and efficiency …
[PDF][PDF] Embedding planar graphs on the grid
W Schnyder - Proceedings of the first annual ACM-SIAM …, 1990 - acm.math.spbu.ru
Embedding Planar Graphs on the Grid Page 1 Chapter 15 - Embedding Planar Graphs on the
Grid Walter Schnyder*+ Abstract. We show that each plane graph of order n 2 3 has a straight …
Grid Walter Schnyder*+ Abstract. We show that each plane graph of order n 2 3 has a straight …
[图书][B] Handbook of graph drawing and visualization
R Tamassia - 2013 - books.google.com
Get an In-Depth Understanding of Graph Drawing Techniques, Algorithms, Software, and
Applications The Handbook of Graph Drawing and Visualization provides a broad, up-to …
Applications The Handbook of Graph Drawing and Visualization provides a broad, up-to …
Separators for sphere-packings and nearest neighbor graphs
A collection of n balls in d dimensions forms ak-ply system if no point in the space is covered
by more than k balls. We show that for every k-ply system Γ, there is a sphere S that …
by more than k balls. We show that for every k-ply system Γ, there is a sphere S that …
On-line planarity testing
G Di Battista, R Tamassia - SIAM Journal on Computing, 1996 - SIAM
The on-line planarity-testing problem consists of performing the following operations on a
planar graph G:(i) testing if a new edge can be added to G so that the resulting graph is itself …
planar graph G:(i) testing if a new edge can be added to G so that the resulting graph is itself …
A linear-time algorithm for drawing a planar graph on a grid
M Chrobak, TH Payne - Information Processing Letters, 1995 - Elsevier
Information keying Page 1 ELSEVIER Information Processing Letters 54 (1995) 241-246
Information keying A linear-time algorithm for drawing a planar graph on a grid M. Chrobak …
Information keying A linear-time algorithm for drawing a planar graph on a grid M. Chrobak …
[图书][B] Graph drawing and applications for software and knowledge engineers
K Sugiyama - 2002 - books.google.com
This book is useful for readers who want to visualize graphs as representing structural
knowledge in a variety of fields. It gives an outline of the whole field, describes in detail the …
knowledge in a variety of fields. It gives an outline of the whole field, describes in detail the …
An experimental comparison of four graph drawing algorithms
In this paper we present an extensive experimental study comparing four general-purpose
graph drawing algorithms. The four algorithms take as input general graphs (with no …
graph drawing algorithms. The four algorithms take as input general graphs (with no …
Convex grid drawings of 3-connected planar graphs
We consider the problem of embedding the vertices of a plane graph into a small
(polynomial size) grid in the plane in such a way that the edges are straight, nonintersecting …
(polynomial size) grid in the plane in such a way that the edges are straight, nonintersecting …