Low Time Complexity Algorithms for Path Computation in Cayley Graphs

Discrete Applied Mathematics - Netherlands
doi 10.1016/j.dam.2018.12.005
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Elsevier BV

Related search

Path Algorithms on Regular Graphs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
English

Spectral Estimates for Abelian Cayley Graphs

Journal of Combinatorial Theory. Series B
CombinatoricsComputational TheoryDiscrete MathematicsTheoretical Computer ScienceMathematics
2006English

Quartic Integral Cayley Graphs

Ars Mathematica Contemporanea
AlgebraCombinatoricsNumber TheoryGeometryDiscrete MathematicsTheoretical Computer ScienceTopology
2015English

Tree Spanners on Chordal Graphs: Complexity and Algorithms

Theoretical Computer Science
Computer ScienceTheoretical Computer Science
2004English

Approximation Algorithms and Complexity Results for Path Problems in Trees of Rings

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2001English

On Two-Dimensional Cayley Graphs

Algebraic Structures and their Applications
Applied MathematicsNumber TheoryAlgebra
2017English

Eigenspaces of Hamming Graphs and Unitary Cayley Graphs

Ars Mathematica Contemporanea
AlgebraCombinatoricsNumber TheoryGeometryDiscrete MathematicsTheoretical Computer ScienceTopology
2010English

Low-Complexity Detection Algorithms for Spatial Modulation MIMO Systems

Journal of Electrical and Computer Engineering
Electronic EngineeringSignal ProcessingElectricalComputer Science
2018English

Integral Cayley Sum Graphs and Groups

Discussiones Mathematicae - Graph Theory
CombinatoricsApplied MathematicsDiscrete Mathematics
2016English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy