Results 51 to 60 of about 1,353,416 (150)

Construction of a user-friendly software-defined networking management using a graph-based abstraction layer [PDF]

PeerJ Computer Science
The software-defined networking (SDN) paradigm relies on the decoupling of the control plane and data plane. Northbound interfaces enable the implementation of network services through logical centralised control.
Yufeng Jia, Jiadong Ren, Xianshan Li, Haitao He, Pengwei Zhang, Rong Li   +5 more
doaj   +2 more sources

Drawing planar graphs with prescribed face areas

Journal of Computational Geometry, 2018
We study drawings of planar graphs where every inner face has a prescribed area. A plane graph is 'area-universal' if for every area assignment on the inner faces, there exists a straight-line drawing realizing the assigned areas.
Linda Kleist
doaj   +1 more source

Augmenting the Connectivity of Planar and Geometric Graphs

Journal of Graph Algorithms and Applications, 2012
In this paper we study connectivity augmentation problems. Given a connected graph G with some desirable property, we want to make G 2-vertex connected (or 2-edge connected) by adding edges such that the resulting graph keeps the property.
Ignaz Rutter, Alexander Wolff
doaj   +1 more source

Homothetic triangle representations of planar graphs

Journal of Graph Algorithms and Applications, 2019
We prove that every planar graph is the intersection graph of homothetic triangles in the plane.
Daniel Gonçalves, Benjamin Lévêque, Alexandre Pinlou   +2 more
doaj   +1 more source

Orthogonal Drawings of Plane Graphs without Bends [PDF]

, 2002
In an orthogonal drawing of a plane graph G each vertex is drawn as a point and each edge is drawn as a sequence of vertical and horizontal line segments. A point at which the drawing of an edge changes its direction is called a bend.
Rahman, Md. Saidur, Takao Nishizeki, Nishizeki, Takao, Mahmuda Naznin, Naznin, Mahmuda, Md. Saidur Rahman   +5 more
core   +1 more source

A Note on Minimum-Segment Drawings of Planar Graphs

Journal of Graph Algorithms and Applications, 2013
A straight-line drawing of a planar graph G is a planar drawing of G such that each vertex is mapped to a point on the Euclidean plane, each edge is drawn as a straight line segment, and no two edges intersect except possibly at a common endpoint ...
Stephane Durocher, Debajyoti Mondal, Rahnuma Islam Nishat, Sue Whitesides   +3 more
doaj   +1 more source

Facial Rainbow Coloring of Plane Graphs

Discussiones Mathematicae Graph Theory, 2019
A vertex coloring of a plane graph G is a facial rainbow coloring if any two vertices of G connected by a facial path have distinct colors. The facial rainbow number of a plane graph G, denoted by rb(G), is the minimum number of colors that are necessary
Jendroľ Stanislav, Kekeňáková Lucia
doaj   +1 more source

THE ENTIRE FACE IRREGULARITY STRENGTH OF A BOOK WITH POLYGONAL PAGES

Barekeng, 2015
A face irregular entire labeling is introduced by Baca et al. recently, as a modification of the well-known vertex irregular and edge irregular total labeling of graphs and the idea of the entire colouring of plane graph.
Meilin I. Tilukay, Venn Y. I. Ilwaru
doaj   +1 more source

Polyhedral Computations for the Simple Graph Partitioning Problem [PDF]

The simple graph partitioning problem is to partition an edge-weighted graph into mutually disjoint subgraphs, each containing no more than b nodes, such that the sum of the weights of all edges in the subgraphs is maximal.
Sørensen, Michael M.
core  

Graph Algorithm Animation with Grrr [PDF]

, 2000
We discuss geometric positioning, highlighting of visited nodes and user defined highlighting that form the algorithm animation facilities in the Grrr graph rewriting programming language. The main purpose of animation was initially for the debugging and
Peter J. Rodgers, Rodgers, Peter, Vidal, Natalia, Natalia Vidal   +3 more
core   +1 more source