Results 51 to 60 of about 89 (87)
Edge Colouring Reduced Indifference Graphs
, 1999 The chromatic index problem -- finding the minimum number of colours required for colouring the edges of a graph -- is still unsolved for indifference graphs, whose vertices can be linearly ordered so that the vertices contained in the same maximal ...
Celina M. H. De Figueiredo +3 more
core
Highly parallel sparse matrix-matrix multiplication
, 2010 . Generalized sparse matrix-matrix multiplication (or SpGEMM) is a key primitive for many high performance graph algorithms as well as for some linear solvers, such as algebraic multi-grid.
R. Gilbert, Aydin Buluc, John
core
Robust Matchings, Maximum Clustering, and Maximum Capacitated Medians
, 1999 We consider complete graphs with nonnegative edge weights. A p-matching is a set of p disjoint edges. We prove the existence of a maximal (with respect to inclusion) matching M that contains for any p jM j p edges whose total weight is at least 1 p 2
Refael Hassin, Shlomi Rubinstein
core
Recognizing Circulant Graphs of Prime Order in Polynomial Time
, 1998 A circulant graph G of order n is a Cayley graph over the cyclic group Z n : Equivalently, G is circulant iff its vertices can be ordered such that the corresponding adjacency matrix becomes a circulant matrix. To each circulant graph we may associate a
Mikhail E. Muzychuk, Gottfried Tinhofer
core
Constructing Worst Case Instances for Semidefinite Programming Based Approximation Algorithms
, 2001 SL,BAEb#[1 programming based approximation algorithms, such as the Goemans and Williamson approximation algorithm for the MAX CUT problem, are usually shown to have certain performance guarantees using local ratio techniques.
Benny Sudakov, Uri Zwick, Noga Alon
core
A simple algorithm for constructing Szemerédi's Regularity Partition
, 1999 We give a simple constructive version of Szemer'edi's Regularity Lemma, based on the computation of singular values of matrices. Mathematical Reviews Subject Numbers: 05C85, 68R10.
Alan Frieze, Ravi Kannan
core
Dominating Sets Whose Closed Stars Form Spanning Trees
, 1995 For a subset W of vertices of an undirected graph G, let S(W ) be the subgraph consisting of W , all edges incident to at least one vertex in W , and all vertices adjacent to at least one vertex in W .
Jerrold W. Grossman
core
Local Conditions for Edge-Coloring
, 1995 In this note, we investigate three versions of the overfull property for graphs and their relation to the edge-coloring problem. Each of these properties implies that the graph cannot be edge-colored with \Delta colors, where \Delta is the maximum degree.
Celina M. H. De Figueiredo +2 more
core
We study formal path expressions for two edge-labeled two-terminal directed acyclic graph families: directed triangulated grid graphs (TGGs) and directed king graphs.
Vadim E. Levit, Mark Korenblit
core +1 more source
Optimizing Bull-Free Perfect Graphs
, 1997 . A bull is a graph obtained by adding a pendant vertex at two vertices of a triangle. Here we present polynomial-time combinatorial algorithms for the optimal weighted coloring and weighted clique problems in bull-free perfect graphs. The algorithms are
Celina M. H. De Figueiredo +1 more
core