|
Size: 10684
Comment:
|
Size: 1478
Comment:
|
| Deletions are marked like this. | Additions are marked like this. |
| Line 1: | Line 1: |
| == Introduction == | [[TableOfContents]] == Introduction == |
| Line 5: | Line 7: |
| The main people working on this project are Emily Kirkman and Robert Miller. | The main people working on this project are Emily Kirkman, Robert Miller and Bobby Moretti. |
| Line 7: | Line 9: |
| == Survey of existing Graph Theory software == | == Current Status == |
| Line 9: | Line 11: |
| A. Software included with SAGE I. GAP I. Maxima I. Singular I. PARI, MWRANK, NTL I. Matplotlib I. GSL, Numeric |
* We are currently seeking feedback on our survey of existing graph theory software. * We hope to begin the initial benchmarks this week. These will deal mostly with construction, retrieval and basic algorithms. * On Friday, October 20th Robert Miller will be giving a talk in PDL C-401 on graph theory and optimal algorithms. The talk is at 4? 5? Somebody that knows the correct time should put it in... |
| Line 17: | Line 15: |
| A. Software SAGE interfaces with (but does not include) | == Wiki Pages == |
| Line 19: | Line 17: |
| I. [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 1. '''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] 1. '''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; 1. '''Decorations''' (Coloring, Weight, Flow, etc.) . Vertices have labels only; Edges have labels, capacity(non-negative integers, loops=0) and weights(totally ordered ring); 1. '''Invariants''' . #verts, #edges; characteristic polynomial; spectrum 1. '''Predicates''' . 2 verts incident, 2 edges incident, 1 vertex and 1 edge incident, subgraph, bipartite, complete, Eulerian, tree, forest, empty, null, path, polygon, regular 1. '''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, 1. '''Adjacency, etc.''' . (in- & out-) degree, degree vector, valence (if regular), vertex nbrs, edge nbrs, bipartition, dominating sets 1. '''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 1. '''Paths, etc.''' . distance and geodesic, diameter and corr. path, ball and sphere, distance partition, equitable partition, girth and corr. cycle 1. '''Trees, etc.''' . spanning tree, breadth first and depth first searches, rooted, root, parent, vertex paths 1. '''Colorings'''(see also Decorations) . chromatic number and index, optimal vertex and edge colorings, chromatic polynomial 1. '''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, 1. '''Embedding''' (Planar graphs, etc.) . planarity, Kuratowski subgraphs, faces of a planar graph, embedding info as orientation of edges from a vertex 1. '''Algebra''' . adjacency matrix, distance matrix, incidence matrix, intersection matrix 1. '''Morphisms/Group Actions''' . interfaces ''nauty'' 1. '''Symmetry''' . vertex, edge and distance transitivity; orbit partitions; primitivity; symmetric; distance regularity and intersection array 1. '''Geometry''' . Go back and forth between incidence and coset geometries and their graphs; finite planes; 1. '''Generation/Random Graphs''' . interfaces ''nauty'' 1. '''Database''' . database interface, strongly regular graph DB, random graph from DB, slick implementation of for loops ("for G in D do ... end for;") I. Maple: '''networks''' package, which includes: 1. '''Representation''' . ? 1. '''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, 1. '''Decorations''' (Coloring, Weight, Flow, etc.) . vertex weights default to 0, edge weights default to 1 (can be any valid maple expression) 1. '''Invariants''' . characteristic polynomial 1. '''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."), 1. '''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)}$."), 1. '''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, 1. '''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.") 1. '''Colorings''' . chromatic polynomial, 1. '''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, 1. '''Embedding''' (Planar graphs, etc.) . isplanar, 1. '''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, 1. '''Generation/Random Graphs''' . random graphs- specify #verts and prob of edge occuring, or #verts and #edges 1. '''Database''' . show command shows a table of known information about a network 1. '''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.") I. Mathematica I. mwrank I. Octave I. Tachyon Ray Tracer A. Extensions of software that SAGE interfaces with I. Magma I. Maple I. Mathematica I. mwrank I. Octave I. Tachyon Ray Tracer A. Software that SAGE can now include as is (not as an optional package...) A. Software that SAGE should include (or maybe interface with), pending stuff (e.g. licensing) A. Software that is incompatible with SAGE but still useful Functionality categories: 1. '''Representation''' 1. '''Storage/Pipes''' 1. '''Construction''' 1. '''Decorations''' (Coloring, Weight, Flow, etc.) 1. '''Invariants''' 1. '''Predicates''' 1. '''Subgraphs and Subsets''' 1. '''Adjacency, etc.''' 1. '''Connectivity''' 1. '''Paths, etc.''' 1. '''Trees, etc.''' 1. '''Colorings''' 1. '''Optimization''' 1. '''Embedding''' (Planar graphs, etc.) 1. '''Algebra''' 1. '''Morphisms/Group Actions''' 1. '''Symmetry''' 1. '''Geometry''' 1. '''Topology''' 1. '''Generation/Random Graphs''' 1. '''Database''' 1. '''Visualization''' |
=== Survey of Existing Software === * [http://sage.math.washington.edu:9001/graph_survey Link] * We have attempted to make a complete list of existing graph theory software. We posted functionality lists and some algorithm/construction summaries. We are very interested in feedback or last-minute additions, as we are ready to begin benchmarking our findings. === Initial Benchmark Results === * [http://sage.math.washington.edu:9001/graph_benchmark Link] * Our initial tests are designed to compare the constructions and very basic functionality found in our survey of existing software. At this stage in the game, we are testing to find the best way to construct graph objects in SAGE. * We will post results on the wiki as we get them. And as always, we love feedback! |
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, Robert Miller and Bobby Moretti.
Current Status
- We are currently seeking feedback on our survey of existing graph theory software.
- We hope to begin the initial benchmarks this week. These will deal mostly with construction, retrieval and basic algorithms.
- On Friday, October 20th Robert Miller will be giving a talk in PDL C-401 on graph theory and optimal algorithms. The talk is at 4? 5? Somebody that knows the correct time should put it in...
Wiki Pages
Survey of Existing Software
- We have attempted to make a complete list of existing graph theory software. We posted functionality lists and some algorithm/construction summaries. We are very interested in feedback or last-minute additions, as we are ready to begin benchmarking our findings.
Initial Benchmark Results
- Our initial tests are designed to compare the constructions and very basic functionality found in our survey of existing software. At this stage in the game, we are testing to find the best way to construct graph objects in SAGE.
- We will post results on the wiki as we get them. And as always, we love feedback!