Browse Prior Art Database

Improving topology graph readability by coloring edges.

IP.com Disclosure Number: IPCOM000241293D
Publication Date: 2015-Apr-14
Document File: 1 page(s) / 22K

Publishing Venue

The IP.com Prior Art Database

Abstract

The purpose of this article is to show how to increase the readability of a graph. This approach focuses on one of the possible solution of the problem where the minimum amount of colours are used for path colouring.

This text was extracted from a PDF file.
This is the abbreviated version, containing approximately 65% of the total text.

Page 01 of 1

Improving topology graph readability by coloring edges .

Graphs are commonly used to visualize the relations and connection between different elements. They are useful when the amount of elements are limited. Very often number of related elements increase and the readability of the visualization decrease. All solutions increase readability by increasing the size paths or nodes, layout elements in the proper distant, layout paths to prevent crossing them. Often all these steps are insufficient.

It is difficult to realize how components are connected when diagram contains many components with lots of connection. Often topology shows tangle of paths without distinction connection between components.

Connections (paths) displayed in topology should have assigned different colors to emphasize which nodes they connect. Colors should be assigned to paths in that way that no two paths which have common vertex do not have the same color. The solution is similar to coloring countries on the map. Proposed solution was not used to increase topology readability.

There are well know solutions for graph coloring problems. They are commonly used for optimal (or almost optimal) allocation limited resources (e.g. http://www.google.com/patents/US8023462, http://www.google.com/patents/US20050039175), but they are not used to improve topology graph readability.

The main idea is use the same color for paths which are not neighbors. But before that paths have to be sorted in proper or...