Product
Help
Pricing
About
Jobs
Log in
Get started
Keyword
Add to collection
graph covering
Description:
A graph covering is a graph-theoretic mapping from one graph to another that locally preserves the structure around each vertex.
Primary topic:
Advanced Graph Theory Research (30%)
Related topics:
Advanced Graph Theory Research (30%),
Finite Group Theory Research (17%)
OpenAlex ID:
keywords/graph-covers
A General Approximation Technique for Constrained Forest Problems
1995
·
Michel X. Goemans
, David P. Williamson
·
SIAM Journal on Computing
·
884
Using Linear Programming to Decode Binary Linear Codes
2005
·
J. Feldman
, M.J. Wainwright
, et al.
·
IEEE Transactions on Information Theory
·
547
Sparse partitions
2002
·
B. Awerbuch
, D. Peleg
·
Annual Symposium on Foundations of Computer Science
·
314
An O'Nan-Scott Theorem for Finite Quasiprimitive Permutation Groups and an Application to 2-Arc Transitive Graphs
1993
·
Cheryl E. Praeger
·
Journal of the London Mathematical Society
·
294
Zeta Functions of Finite Graphs and Coverings
1996
·
H.M. Stark
, A.A. Terras
·
Advances in Mathematics
·
252
A fast algorithm for building lattices
1999
·
Lhouari Nourine
, Olivier Raynaud
·
Information Processing Letters
·
249
Graph-Cover Decoding and Finite-Length Analysis of Message-Passing Iterative Decoding of LDPC Codes
2005
·
Vontobel, Pascal O.
, Koetter, Ralf
·
arXiv (Cornell University)
·
227
PDF
Generating all graph coverings by permutation voltage assignments
1977
·
Jonathan L. Gross
, Thomas W. Tucker
·
Discrete Mathematics
·
216
Some covering concepts in graphs
1970
·
Michael D. Plummer
·
Journal of Combinatorial Theory
·
215
PDF
Paths, Stars and the Number Three
1996
·
Bruce Reed
·
Combinatorics Probability Computing
·
185
Regular groups of automorphisms of cubic graphs
1980
·
Dragomir Ž Djoković
, Gary L Miller
·
Journal of Combinatorial Theory Series B
·
160
Covering and Packing in Graphs, I.
1970
·
Frank Harary
·
Annals of the New York Academy of Sciences
·
152
On model checking for non-deterministic infinite-state systems
2002
·
E.A. Emerson
, K.S. Namjoshi
·
ACM/IEEE Symposium on Logic in Computer Science (LICS)
·
145
Deriving Good LDPC Convolutional Codes from LDPC Block Codes
2011
·
A E Pusane
, R Smarandache
, et al.
·
IEEE Transactions on Information Theory
·
127
PDF
Finite common coverings of graphs
1982
·
Frank Thomson Leighton
·
Journal of Combinatorial Theory Series B
·
120
PDF
Matchings, coverings, and Castelnuovo-Mumford regularity
2014
·
Russ Woodroofe
·
Journal of Commutative Algebra
·
114
PDF
Two Algorithms for Bipartite Graphs
1963
·
A. L. Dulmage
, N. S. Mendelsohn
·
Journal of the Society for Industrial and Applied Mathematics
·
114
Matchings, Coverings, and Castelnuovo-mumford Regularity
·
Russ Woodroofe
·
108
LP Decoding Corrects a Constant Fraction of Errors
2007
·
J. Feldman
, T. Malkin
, et al.
·
IEEE Transactions on Information Theory
·
107
Medians in median graphs
1984
·
H.J. Bandelt
, J.P. Barthélemy
·
Discrete Applied Mathematics
·
105
Covering and packing in graphs. III: Cyclic and acyclic invariants
1980
·
Jin Akiyama
, Geoffrey Exoo
, et al.
·
Czech digital mathematics library
·
105
PDF
A soluble self-avoiding walk problem
1963
·
P.W. Kasteleyn
·
Physica
·
95
Distance regular covers of the complete graph
1992
·
C.D Godsil
, A.D Hensel
·
Journal of Combinatorial Theory Series B
·
90
Counting in Graph Covers: A Combinatorial Characterization of the Bethe Entropy Function
2013
·
Pascal O. Vontobel
·
IEEE Transactions on Information Theory
·
84
PDF
A census of semisymmetric cubic graphs on up to 768 vertices
2006
·
Marston Conder
, Aleksander Malnič
, et al.
·
Journal of Algebraic Combinatorics
·
84
PDF
Show more works
View as search
Works count:
1,110
Citation count:
12,750
Year
Topic
Type