Results 51 to 60 of about 104 (103)
Sub-exponential Time Parameterized Algorithms for Graph Layout Problems on Digraphs with Bounded Independence Number. [PDF]
Algorithmica, 2023 Misra P, Saurabh S, Sharma R, Zehavi M.
europepmc +1 more source
Total-Chromatic Number and Chromatic Index of Dually Chordal Graphs
, 2007 A graph is dually chordal if it is the clique graph of a chordal graph. Alternatively, a graph is dually chordal if it admits a maximum neighbourhood order. This class generalizes known subclasses of chordal graphs such as doubly chordal graphs, strongly
Celina M. H. De Figueiredo +3 more
core
Counting and optimising maximum phylogenetic diversity sets. [PDF]
J Math Biol, 2022 Manson K, Semple C, Steel M.
europepmc +1 more source
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
Subexponential-Time Algorithms for Finding Large Induced Sparse Subgraphs. [PDF]
Algorithmica, 2021 Novotná J +5 more
europepmc +1 more source
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
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
The hybrid number of a ploidy profile. [PDF]
J Math Biol, 2022 Huber KT, Maher LJ.
europepmc +1 more source
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