799 research outputs found
Edge coloring of a graph
Thesis (Master)--Izmir Institute of Technology, Mathematics, Izmir, 2004Includes bibliographical references (leaves: 35-36)Text in English; Abstract: Turkish and Englishviii, 36 leavesThe edge coloring problem is one of the fundamental problem on graphs which often appears in various scheduling problems like the le transfer problem on computer networks. In this thesis, we survey old and new results on the classical edge coloring as well as the generalized edge coloring problems. In addition, we developed some algorithms and modules by using Combinatorica package to color the edges of graphs with webMathematica which is the new web-based technology
Parallel Maximum Clique Algorithms with Applications to Network Analysis and Storage
We propose a fast, parallel maximum clique algorithm for large sparse graphs
that is designed to exploit characteristics of social and information networks.
The method exhibits a roughly linear runtime scaling over real-world networks
ranging from 1000 to 100 million nodes. In a test on a social network with 1.8
billion edges, the algorithm finds the largest clique in about 20 minutes. Our
method employs a branch and bound strategy with novel and aggressive pruning
techniques. For instance, we use the core number of a vertex in combination
with a good heuristic clique finder to efficiently remove the vast majority of
the search space. In addition, we parallelize the exploration of the search
tree. During the search, processes immediately communicate changes to upper and
lower bounds on the size of maximum clique, which occasionally results in a
super-linear speedup because vertices with large search spaces can be pruned by
other processes. We apply the algorithm to two problems: to compute temporal
strong components and to compress graphs.Comment: 11 page
Loopedia, a Database for Loop Integrals
Loopedia is a new database at loopedia.org for information on Feynman
integrals, intended to provide both bibliographic information as well as
results made available by the community. Its bibliometry is complementary to
that of SPIRES or arXiv in the sense that it admits searching for integrals by
graph-theoretical objects, e.g. its topology.Comment: 16 pages, lots of screenshot
JGraphT -- A Java library for graph data structures and algorithms
Mathematical software and graph-theoretical algorithmic packages to
efficiently model, analyze and query graphs are crucial in an era where
large-scale spatial, societal and economic network data are abundantly
available. One such package is JGraphT, a programming library which contains
very efficient and generic graph data-structures along with a large collection
of state-of-the-art algorithms. The library is written in Java with stability,
interoperability and performance in mind. A distinctive feature of this library
is the ability to model vertices and edges as arbitrary objects, thereby
permitting natural representations of many common networks including
transportation, social and biological networks. Besides classic graph
algorithms such as shortest-paths and spanning-tree algorithms, the library
contains numerous advanced algorithms: graph and subgraph isomorphism; matching
and flow problems; approximation algorithms for NP-hard problems such as
independent set and TSP; and several more exotic algorithms such as Berge graph
detection. Due to its versatility and generic design, JGraphT is currently used
in large-scale commercial, non-commercial and academic research projects. In
this work we describe in detail the design and underlying structure of the
library, and discuss its most important features and algorithms. A
computational study is conducted to evaluate the performance of JGraphT versus
a number of similar libraries. Experiments on a large number of graphs over a
variety of popular algorithms show that JGraphT is highly competitive with
other established libraries such as NetworkX or the BGL.Comment: Major Revisio
(Symplectic) Leaves and (5d Higgs) Branches in the Poly(go)nesian Tropical Rain Forest
We derive the structure of the Higgs branch of 5d superconformal field
theories or gauge theories from their realization as a generalized toric
polygon (or dot diagram). This approach is motivated by a dual, tropical curve
decomposition of the 5-brane-web system. We define an edge coloring,
which provides a decomposition of the generalized toric polygon into a refined
Minkowski sum of sub-polygons, from which we compute the magnetic quiver. The
Coulomb branch of the magnetic quiver is then conjecturally identified with the
5d Higgs branch. Furthermore, from partial resolutions, we identify the
symplectic leaves of the Higgs branch and thereby the entire foliation
structure. In the case of strictly toric polygons, this approach reduces to the
description of deformations of the Calabi-Yau singularities in terms of
Minkowski sums.Comment: 68 pages, 1 figure, many Tikz pictures, and 1 ancillary Mathematica
noteboo
- …