Results 1  10
of
323
Faster Canonical Forms For Strongly Regular Graphs (Extended Abstract)
, 2013
"... We show that a canonical form for strongly regular (s. r.) graphs can be found in time exp ( ˜O(n1/5)) and therefore isomorphism of s. r. graphs can be tested within the same time bound, where n is the number of vertices and the tilde hides a polylogarithmic factor. The best previous bound for test ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
We show that a canonical form for strongly regular (s. r.) graphs can be found in time exp ( ˜O(n1/5)) and therefore isomorphism of s. r. graphs can be tested within the same time bound, where n is the number of vertices and the tilde hides a polylogarithmic factor. The best previous bound
A spectral technique for correspondence problems using pairwise constraints
 In International Conference on Computer Vision
, 2005
"... Abstract We present an efficient spectral method for finding consistent correspondences between two sets of features. We build the adjacency matrix M of a graph whose nodes represent the potential correspondences and the weights on the links represent pairwise agreements between potential correspon ..."
Abstract

Cited by 251 (10 self)
 Add to MetaCart
correspondences. Correct assignments are likely to establish links among each other and thus form a strongly connected cluster. Incorrect correspondences establish links with the other correspondences only accidentally, so they are unlikely to belong to strongly connected clusters. We recover the correct
A new alternating minimization algorithm for total variation image reconstruction
 SIAM J. IMAGING SCI
, 2008
"... We propose, analyze and test an alternating minimization algorithm for recovering images from blurry and noisy observations with total variation (TV) regularization. This algorithm arises from a new halfquadratic model applicable to not only the anisotropic but also isotropic forms of total variati ..."
Abstract

Cited by 224 (26 self)
 Add to MetaCart
We propose, analyze and test an alternating minimization algorithm for recovering images from blurry and noisy observations with total variation (TV) regularization. This algorithm arises from a new halfquadratic model applicable to not only the anisotropic but also isotropic forms of total
Coil sensitivity encoding for fast MRI. In:
 Proceedings of the ISMRM 6th Annual Meeting,
, 1998
"... New theoretical and practical concepts are presented for considerably enhancing the performance of magnetic resonance imaging (MRI) by means of arrays of multiple receiver coils. Sensitivity encoding (SENSE) is based on the fact that receiver sensitivity generally has an encoding effect complementa ..."
Abstract

Cited by 193 (3 self)
 Add to MetaCart
or collimation but by spectral analysis. The idea of Lauterbur (1) to encode object contrast in the resonance spectrum by a magnetic field gradient forms the exclusive basis of signal localization in Fourier imaging. However powerful, the gradientencoding concept implies a fundamental restriction. Only one
Strongly regular mCayley circulant graphs and digraphs
, 2015
"... The first part of this paper is a survey about strongly regular graphs and digraphs admitting a semiregular cyclic group of automorphisms. In the second part, some new types of such digraphs, called uniform and almost uniform, are studied. By using partial sum families, the form of the parameters i ..."
Abstract
 Add to MetaCart
The first part of this paper is a survey about strongly regular graphs and digraphs admitting a semiregular cyclic group of automorphisms. In the second part, some new types of such digraphs, called uniform and almost uniform, are studied. By using partial sum families, the form of the parameters
Abstracts 1 Spherical embeddings of strongly regular graphs
, 2015
"... In their seminal work Delsarte, Goethals and Seidel described, among many other things, certain spherical embeddings of strongly regular graphs. In this talk we will characterize all spherical embeddings of strongly regular graphs via the embeddings of Delsarte, Goethals and Siedel, show that only t ..."
Abstract
 Add to MetaCart
In their seminal work Delsarte, Goethals and Seidel described, among many other things, certain spherical embeddings of strongly regular graphs. In this talk we will characterize all spherical embeddings of strongly regular graphs via the embeddings of Delsarte, Goethals and Siedel, show that only
An efficient algorithm for graph isomorphism
 J. ASSOC. COMPUT. MACH
, 1970
"... A procedure for determining whether two graphs are isomorphic is described. During the procedure, from any given graph two graphs, the representat ive graph and the reordered graph, are derived. The representative graph is a homomorphic image of the original graph; the reordered graph is constructe ..."
Abstract

Cited by 72 (0 self)
 Add to MetaCart
power of n, the order of the given graph. This power is a function of an adjacency property known as the strong regularity of the given graph. For graphs that do not contain a strongly regular transit ive subgraph, the power is, at worst, five.
The Complexity of McKay's Canonical Labeling Algorithm
, 1996
"... We study the time complexity of McKay's algorithm to compute canonical forms and automorphism groups of graphs. The algorithm is based on a type of backtrack search, and it performs pruning by discovered automorphisms and by hashing partial information of vertex labelings. In practice, the algo ..."
Abstract

Cited by 51 (1 self)
 Add to MetaCart
, the algorithm is implemented in the nauty package. We obtain colorings of Furer's graphs that allow the algorithm to compute their canonical forms in polynomial time. We then prove an exponential lower bound of the algorithm for connected 3regular graphs of colorclass size 4 using Furer
Quadratic ZeroDifference Balanced Functions, APN Functions and Strongly Regular Graphs
, 2014
"... Let F be a function from Fpn to itself and δ a positive integer. F is called zerodifference δbalanced if the equation F (x+a)−F (x) = 0 has exactly δ solutions for all nonzero a ∈ Fpn. As a particular case, all known quadratic planar functions are zerodifference 1balanced; and some quadratic AP ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
set, and hence yields strongly regular graphs; this generalizes the constructions of strongly regular graphs using planar functions by Weng et al. Using recently discovered quadratic APN functions on F28, we obtain 15 new (256, 85, 24, 30) negative Latin square type strongly regular graphs.
A note on Order and Eigenvalue Multiplicity of Strongly Regular Graphs
"... In this note, we consider a well known upper bound for the order of a strongly regular graph in terms of the multiplicity of a nonprincipal eigenvalue of its adjacency matrix. Key words and phrases: adjacency matrix, eigenvalue multiplicity, strongly regular graph. AMS Mathematics Subject Classific ..."
Abstract
 Add to MetaCart
Classification (2010): 05C50, 05E30. A strongly regular graph srg(n, k, λ, µ) is a regular graph of order n and degree k such that any two adjacent vertices have λ common neighbors and any two nonadjacent vertices have µ common neighbors. Strongly regular graphs form an important class of graphs which lie
Results 1  10
of
323