Diff for "graph"

Introduction

The SAGE Graph Theory Project aims to implement Graph objects and algorithms in ["SAGE"].

The main people working on this project are Emily Kirkman and Robert Miller.

Survey of existing Graph Theory software

1. Software included with SAGE
   1. GAP
   2. Maxima
   3. Singular
   4. PARI, MWRANK, NTL
   5. Matplotlib
   6. GSL, Numeric
2. Software SAGE interfaces with (but does not include)

   1. [http://magma.maths.usyd.edu.au/magma/htmlhelp/text1452.htm Magma]

      1. Representation

         • Sparse support; function computes memory requirement for graph with n verts and m edges; consists of graph itself, vertex set, and edge set

      2. Storage/Pipes

         • one function opens either file or stream, files stored in [http://cs.anu.edu.au/~bdm/data/formats.html Graph6 and Sparse6 format]

      3. Construction

         • From matrix; from edge tuples; from vertex neighbors; from edges of other graphs; subgraphs; quotient graphs; incremental construction; complement; contraction; breaking edges; line graph; switch nbrs for non-nbrs of a vertex; disjoint unions, edge unions; complete unions; cartesian, lexicographic and tensor products; n-th power (same vert set, incident iff dist \leq n); graph \leftrightarrow digraph; Cayley graph constructor; Schreier graph constructor; Orbital graph constructor; Closure graph constructor (given G, add edges to make G invariant under a given permutation group); Paley graphs and tournaments; graphs from incidence structures; converse(reverse digraph); n-th odd graph; n-th triangular graph; n-th square lattice graph; Clebsch, Shrikhande, Gewirtz and Chang graphs;

      4. Decorations (Coloring, Weight, Flow, etc.)

         • Vertices have labels only; Edges have labels, capacity(non-negative integers, loops=0) and weights(totally ordered ring);

      5. Invariants

         • #verts, #edges; characteristic polynomial; spectrum

      6. Predicates

         • 2 verts incident, 2 edges incident, 1 vertex and 1 edge incident, subgraph, bipartite, complete, Eulerian, tree, forest, empty, null, path, polygon, regular

      7. Subgraphs and Subsets

         • has k-clique, clique number, all cliques, maximum clique ([http://magma.maths.usyd.edu.au/magma/htmlhelp/text1473.htm "When comparing both algorithms in the situation where the problem is to find a maximum clique one observes that in general BranchAndBound does better. However Dynamic outperforms BranchAndBound when the graphs under consideration are large (more then 400 vertices) random graphs with high density (larger than 0.5%). So far, it can only be said that the comparative behaviour of both algorithms is highly dependent on the structure of the graphs."]), independent sets and number,

      8. Adjacency, etc.

         • (in- & out-) degree, degree vector, valence (if regular), vertex nbrs, edge nbrs, bipartition, dominating sets

      9. Connectivity

         • (strongly) connected, components, separable, 2-connected, 2-components, triconnectivity ([http://magma.maths.usyd.edu.au/magma/htmlhelp/text1466.htm "The linear-time triconnectivity algorithm by Hopcroft and Tarjan (HT73) has been implemented with corrections of our own and from C. Gutwenger and P. Mutzel (GM01). This algorithm requires that the graph has a sparse representation."]), k-vertex connectivity, vertex separator, k-edge connectivity, edge separator

      10. Paths, etc.

          • distance and geodesic, diameter and corr. path, ball and sphere, distance partition, equitable partition, girth and corr. cycle

      11. Trees, etc.

          • spanning tree, breadth first and depth first searches, rooted, root, parent, vertex paths

      12. Colorings(see also Decorations)

          • chromatic number and index, optimal vertex and edge colorings, chromatic polynomial

      13. Optimization

          • Max flow min cut (2 algorithms: [http://magma.maths.usyd.edu.au/magma/htmlhelp/text1499.htm#15274 Dinic & push-relabel]), maximum matching for bipartite,

      14. Embedding (Planar graphs, etc.)

          • planarity, Kuratowski subgraphs, faces of a planar graph, embedding info as orientation of edges from a vertex

      15. Algebra

          • adjacency matrix, distance matrix, incidence matrix, intersection matrix

      16. Morphisms/Group Actions

          • interfaces nauty

      17. Symmetry

          • vertex, edge and distance transitivity; orbit partitions; primitivity; symmetric; distance regularity and intersection array

      18. Geometry

          • Go back and forth between incidence and coset geometries and their graphs; finite planes;

      19. Generation/Random Graphs

          • interfaces nauty

      20. Database

          • database interface, strongly regular graph DB, random graph from DB, slick implementation of for loops ("for G in D do ... end for;")

   2. Maple: networks package, which includes:

      1. Representation

         • ?

      2. Construction

         • new (0 verts), void (n verts, 0 edges), incremental construction, complement, complete, contraction, hypercubes, cycle, petersen, cube, icosahedron, dodecahedron, octahedron, tetrahedron, simplify a multigraph, union, subgraphs,

      3. Decorations (Coloring, Weight, Flow, etc.)

         • vertex weights default to 0, edge weights default to 1 (can be any valid maple expression)

      4. Invariants

         • characteristic polynomial

      5. Adjacency, etc.

         • in-nbrs(arrivals), out-nbrs(departures), degree sequence, endpoints, graphical ("tests whether intlist is the degree sequence of a simple graph"), edge-nbrs, vert-nbrs, in-degree, out-degree, max & min degree, edge span & span polynomial ("The span polynomial in variable p gives the probability that G is spanning when each edge operates with probability p.", "When G is connected, this is the all-terminal reliability polynomial of G, and gives the probability that G is connected when each edge operates independently with probability p."),

      6. Connectivity

         • components, edge-connectivity, 2-components, count minimal cutsets, rank ("The rank of an edgeset e is the number of vertices of G minus the number of components of the subgraph induced by e."), Whitney rank polynomial ("The rank polynomial is a sum over all subgraphs H of G of x^{(rank(G) - rank(H))} y^{corank(H)}."),

      7. Paths, etc.

         • diameter, fundcyc ("Given a subset e of edges forming a unicyclic subgraph of a graph G, the edges forming the unique cycle are returned as a set. It is assumed that only one cycle is present."), girth, find path from a to b,

      8. Trees, etc.

         • ancestor, daughter, count spanning trees (Kirchoff Matrix-Tree theorem), cycle base ("A spanning tree is found, and fundcyc() is then used to find all fundamental cycles with respect to this tree. They are returned as a set of cycles with each cycle being represented by a set of edges."), edge disjoint spanning tree, shortest path spanning tree, min weight spanning tree, Tutte polynomial ("The Tutte polynomial is a sum over all maximal forests H of G of t^{ia(H)} z^{ea(H)} where ia(H) is the internal activity of H and ea(H) is the external activity of H.")

      9. Colorings

         • chromatic polynomial,

      10. Optimization

          • maximum flow (flow), Dinic algorithm for max flow (see Magma), flow polynomial ("The flow polynomial in variable h gives the number of nowhere-zero flows on G with edge labels chosen from integers modulo h."), minimum cut,

      11. Embedding (Planar graphs, etc.)

          • isplanar,

      12. Algebra

          • acycpoly ("The acyclicity polynomial in variable p gives the probability that G is acyclic when each edge operates with probability p."), adjacency matrix, distance table (allpairs- optional table gives shortest path trees, rooted at each vertex), incidence matrix,

      13. Generation/Random Graphs

          • random graphs- specify #verts and prob of edge occuring, or #verts and #edges

      14. Database

          • show command shows a table of known information about a network

      15. Visualization

          • plots graphs either in lines (Linear) or in concentric circles (Concentric), ability to give specific graphs specific plotting procedures, 3d plots ("The location of the vertices of the graph is determined as follows. Let A be the adjacency matrix of G and let u, v and w be three eigenvectors of A with corresponding second, third, and fourth largest eigenvalue in absolute value. Then the (x,y,z) coordinates of the ith vertex of G is (u[i],v[i],w[i])."; "Sometimes other symmetries in the graph can be seen by using other eigenvectors. If the optional argument eigenvectors = [e1, e2, e3] is specified, where e1, e2, and e3 are vertex numbers (integers from 1 through the number of vertices), the eigenvectors corresponding to the eigenvalues of these relative magnitudes are used.")

   3. Mathematica: [http://documents.wolfram.com/mathematica/Built-inFunctions/AdvancedDocumentation/DiscreteMath/GraphPlot/ GraphPlot] ([http://documents.wolfram.com/mathematica/Built-inFunctions/AdvancedDocumentation/DiscreteMath/GraphPlot/AdvancedDocumentationGraphPlotReferences.html biblio]) is built-in: also a few functions for "applications" (?); designed to work well with large graphs; also supports graphs from Combinatorica

      1. Representation

         • graph simply is an adjacency matrix (could be sparse), or a list of rules (e.g. {1->2, 2->3, 3->4, 4->1})

      2. Construction

         • N/A (see representation)

      3. Predicates

         • vertex list (apparently only nontrivial when graph is a rule list, see representation)

      4. Subgraphs and Subsets

         • maximal independent vertex sets and edge sets,

      5. Connectivity

         • list strongly connected components,

      6. Paths, etc.

         • distance, pseudo-diameter (see [http://documents.wolfram.com/mathematica/Built-inFunctions/AdvancedDocumentation/DiscreteMath/GraphPlot/AdvancedDocumentationGraphPlotPseudoDiameter.html Documentation])

      7. Trees, etc.

         • [http://documents.wolfram.com/mathematica/Built-inFunctions/AdvancedDocumentation/DiscreteMath/GraphPlot/AdvancedDocumentationGraphPlotTreePlot.html TreePlot] uses the layered drawing algorithm, implements more control:

      8. Optimization

         • maximum matching for bipartite, [http://documents.wolfram.com/mathematica/Built-inFunctions/AdvancedDocumentation/DiscreteMath/GraphPlot/AdvancedDocumentationGraphPlotMinCut.html min cut] problem

      9. Visualization

         • [http://documents.wolfram.com/mathematica/Built-inFunctions/AdvancedDocumentation/DiscreteMath/GraphPlot/AdvancedDocumentationGraphPlotGraphPlotAndGraphPlot3D.html ALGORITHMS] include spring model, spring-electrical model, high-dimensional embedding (random seeds can be given for spring models, link includes options for the spring models); tree algorithms include radial drawing, layered drawing (see G. Di Battista, P. Eades, R. Tamassia, and I. G. Tollis, Algorithms for the Visualization of Graphs, Prentice-Hall, 1999.); vertex styles and colors, edge styles and colors; function to return coordinates without drawing

3. Extensions of software that SAGE interfaces with
   1. Magma
   2. Maple

      1. [http://www.math.uga.edu/~mbaker/REU/maple/laplacian-guide.html 'laplacian.mpl']; [http://www.fmf.uni-lj.si/~mohar/Papers/Spec.pdf here] is a paper on the Laplacian Spectrum

         1. Storage/Pipes

            • creation of certain spreadsheets, such as known eigenvalues and eigenvalues of increasing subdivisions of the graph

         2. Construction

            • banana graphs, star graphs, bouquets and flowers, hypercubes, supercirc (see docs), subdivide edges into n edges, contract, assign directions (apparently in a random way)

         3. Decorations (Coloring, Weight, Flow, etc.)

            • normalilze (so sum of weights = 1)

         4. Algebra

            • discrete laplacian matrix (this function may fight with the built-in laplacian in 'linalg'), compute its eigenvalues given a measure,

         5. Topology

            • (laplacian matrix), effective resistance between vertices, discrete and continuous canonical measure [http://www.math.uga.edu/~mbaker/REU/tex/canonical.pdf#search=%22graph%20tau%22 an unrelated explanation?] and tau (also, taushorten "Investigates the behavior of tau as an edge is shortened"), discrete dx measure

      2. [http://www.cecm.sfu.ca/CAG/papers/GTpaper.pdf GraphTheory] and [http://www.cecm.sfu.ca/CAG/papers/GT2006.pdf Part II] of the paper (haven't yet found the actual package...)

   3. Mathematica

      1. [http://www.combinatorica.com/ Combinatorica] - for a list of functions, see [http://www.cs.sunysb.edu/~skiena/combinatorica/help.pdf help.pdf], page 13-14, 18, 21, 23, 25 - for a [http://www.amazon.com/exec/obidos/ASIN/0521806860/ref=nosim/thealgorithmrepo/ book]

4. Software that SAGE can now include as is (not as an optional package...)

   1. [http://gato.sourceforge.net/ Gato], a tool that animates algorithms, perhaps SAGE cannot actually include right now as is, but license is LGPL, and it requires Python and Tcl/Tk

      • seems that you can write your algorithm in one window and watch it go, supports 3d

   2. [https://networkx.lanl.gov/ NetworkX], seems pretty comprehensive, released under "GNU Lesser General Public License", works on Python \geq 2.3, interfaces with Matplotlib, Pygraphviz, Graphviz, Pydot, numpy or Numeric, Ipython, SciPy, PyGSL, sAsync, PyYAML: EXCELLENT documentation with links to source code from each function descriptor (TODO: make sense of networkx.utils, networkx.threshold)

      1. Representation

         • in Graph and DiGraph, "data structures based on an adjacency list implemented as a node-centric dictionary of dictionaries. The dictionary contains keys corresponding to the nodes and the values are dictionaries of neighboring node keys with the value None (the Python None type). This allows fast addition, deletion and lookup of nodes and neighbors in large graphs"

         • "The XGraph and XDiGraph classes are extensions of the Graph and DiGraph classes... The key difference is that an XGraph edge is a 3-tuple e=(n1,n2,x), representing an undirected edge between nodes n1 and n2 that is decorated with the object x. Here n1 and n2 are (hashable) node objects and x is a (not necessarily hashable) edge object. Since the edge is undirected, edge (n1,n2,x) is equivalent to edge (n2,n1,x). An XDiGraph edge is a similar 3-tuple e=(n1,n2,x), with the additional property of directedness. I.e. e=(n1,n2,x) is a directed edge from n1 to n2 decorated with the object x, and is not equivalent to the edge (n2,n1,x). Whether a graph or digraph allow self-loops or multiple edges is determined at the time of object instantiation via specifying the parameters selfloops=True/False and multiedges=True/False."

      2. Storage/Pipes

         • 'convert' module converts NetworkX graphs to and from other formats: python dict of lists, python dict of dicts, numpy matrices, scipy sparse matrices, pygraphviz;

      3. Construction

         • add path, add cycle, incremental construction, subgraphs, copy, directed \leftrightarrow undirected

      4. Decorations (Coloring, Weight, Flow, etc.)

      5. Invariants

         • density,

      6. Predicates

         • standard predicates,

      7. Subgraphs and Subsets

         • find cliques (Bron & Kerbosch), maximal and bipartite clique graph constructor, project bipartite onto one part (connected if they share a common Top/Bottom Node), clique number and number of maximal cliques, find cliques containing specified node,

      8. Adjacency, etc.

         • neighbors, degree,

      9. Connectivity

         • find k-cores of a graph,

      10. Paths, etc.

      11. Trees, etc.

          • tree class, rooted/directed/forests (experimental classes)

      12. Colorings

      13. Optimization

          • clustering: number of triangles for given nodes, clustering coefficients (fraction of triads, which is edge vertex edge, that are triangles), transitivity (3*triangles/triads);

      14. Embedding (Planar graphs, etc.)

      15. Algebra

      16. Morphisms/Group Actions

          • non-isomorphic checker (does not check isomorphism; only conclusive in the not-isomorphic direction), three versions: fast, faster and fastest

      17. Symmetry

          • betweenness, edge, degree, and closeness centrality

      18. Geometry

      19. Topology

      20. Generation/Random Graphs

      21. Database

      22. Visualization

5. Software that SAGE should include (or maybe interface with, or include as optional), pending stuff (e.g. licensing)

   1. [http://cs.anu.edu.au/~bdm/nauty/ Nauty]

      1. Benchmark program

      2. Source posted, but no public license - should contact Brendan McKay

      3. Written in portable subset of C, python wrapper already in existence (see pynauty)
      4. Nauty interfaces with MAGMA and GRAPE (GAP package)

         1. Construction

            • includes gtools - quick generators for non-isomorphic graphs, also generates bipartite graphs and digraphs

         2. Invariants

            • canonical labelling

         3. Morphisms/Group Actions

            • Computing automorphism groups of graphs and digraphs, isomorphism testing

   2. [http://www.graphviz.org GraphViz]

      1. open source, Common Public License Version 1.0
      2. poorly documented, at least on the web

         1. Visualization

            • DOT makes "hierarchical" drawings of directed graphs. Algorithm aims edges in same direction and attempts to not cross edges and reduce length. NEATO uses spring method, via the Kamada-Kawai algorithm (statistical multi-dimensional scaling) fdp also uses the spring model, via the Fruchterman-Reingold heuristic (handles larger graphs and undirected, clustered graphs)

   3. [http://cs.anu.edu.au/people/bdm/plantri/ plantri and fullgen] written in C, tested mainly on UNIX, weird license ('free for all purposes other than sale for profit. However, they remain subject to our copyright and are not "public domain".'): interesting note, co-authored by Brendan McKay, of nauty

      1. Generation/Random Graphs

         • plantri: "exactly one member of each isomorphism class is output without the need for storing them. The speed of generation is more than 100,000 graphs per second in most cases, so extremely large classes of graph can be exhaustively listed.", classes include planar triangulations, quadrangulations, simple graphs, triangulations of a disc, planar cubic and quartic graphs
         • fullgen generates fullerenes

         • see also [http://hep.physics.indiana.edu/~tsulanke/graphs/surftri/ surftri], which generates triangulations of surfaces of higher genus

6. Software that is incompatible with SAGE but still useful (e.g. web-based applets)

   1. [http://www.geocities.com/pechv_ru/ GRIN]

      1. for windows only
      2. not open-source, but free download

         1. Connectivity

            • bridges and cutpoints

         2. Paths, etc.

            • Paths and Cycles (Eulerian and Hamiltonian), Shortest Paths, Max Capacity Path, K Shortest paths, Critical path

         3. Trees, etc.

            • Minimal spanning tree

         4. Optimization

            • Max Flow

         5. Morphisms/Group Actions

            • Automorphism group

         1. Topology

            • Metrics of the graph Density, Undensity and so on...)

         2. Visualization

            • 2d only, Clipboard edit, decomposition of edges, resize

   2. [http://prolland.free.fr/works/research/dsatphp/dsat.html DSATUR], a program for computing graph colorings, algorithm [http://prolland.free.fr/works/research/dsat/index.html#anchor38034 documentation] in French, input in [http://mat.gsia.cmu.edu/COLOR/general/ccformat.ps DIMACS] format, [http://prolland.free.fr/works/research/dsatphp/dsat.txt source code]

7. Algorithm descriptions for specific problems

   1. [http://rtm.science.unitn.it/intertools/ InterTools]

      1. Maximum Clique in Graphs (MAX-CLIQUE)
      2. Graph Partitioning (equicut)
      3. Quadratic Assignment Problem (QAP)
8. Apparently useless / and/or misc. / and/or etc.

   1. [http://www.npac.syr.edu/NPAC1/PUB/ranka/part/part.html Scalable Libraries for Graph Partitioning], no software yet, but good references on page: "Efficient methods for graph partitioning and incremental graph partitioning are important for parallelization of a large number of unstructured and/or adaptive applications."

Functionality categories

1. Representation

2. Storage/Pipes

3. Construction

4. Decorations (Coloring, Weight, Flow, etc.)

5. Invariants

6. Predicates

7. Subgraphs and Subsets

8. Adjacency, etc.

9. Connectivity

10. Paths, etc.

11. Trees, etc.

12. Colorings

13. Optimization

14. Embedding (Planar graphs, etc.)

15. Algebra

16. Morphisms/Group Actions

17. Symmetry

18. Geometry

19. Topology

20. Generation/Random Graphs

21. Database

22. Visualization