Skip to content
/ graph Public

In mathematics, the graph partition problem is defined on data represented in the form of a graph G = (V,E), with V vertices and E edges, such that it is possible to partition G into smaller components with specific properties.

Notifications You must be signed in to change notification settings

levongh/graph

Folders and files

NameName
Last commit message
Last commit date

Latest commit

30fe01a · Feb 14, 2021

History

50 Commits
Feb 14, 2021
Apr 10, 2017
Aug 25, 2020
Jul 11, 2019
Jun 3, 2019

About

In mathematics, the graph partition problem is defined on data represented in the form of a graph G = (V,E), with V vertices and E edges, such that it is possible to partition G into smaller components with specific properties.

Topics

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published