Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Covering graph

Known as: Covering 
In the mathematical discipline of graph theory, a graph C is a covering graph of another graph G if there is a covering map from the vertex set of C… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2012
Highly Cited
2012
In many practical applications, we need to compute a nonblocking supervisor that not only complies with pre-specified safety… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Highly Cited
2011
Highly Cited
2011
We describe an algorithm for approximate inference in graphical models based on Holder's inequality that provides upper and lower… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Highly Cited
2006
Highly Cited
2006
  • M. O'Sullivan
  • IEEE Transactions on Information Theory
  • 2006
  • Corpus ID: 15351371
In this correspondence, we present a method for constructing sparse matrices that have a compact description and whose associated… Expand
  • figure 1
  • figure 2
  • figure 4
  • figure 5
  • figure 6
Highly Cited
2005
Highly Cited
2005
Easy proofs are given, of the impossibility of solving several consensus problems (Byzantine agreement, weak agreement, Byzantine… Expand
2005
2005
We study the problem of covering graphs with trees and a graph of bounded maximum degree. By a classical theorem of Nash-Williams… Expand
Highly Cited
2005
Highly Cited
2005
The goal of the present paper is the derivation of a framework for the finite-length analysis of message-passing iterative… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
2000
2000
In a projective space PG(n, q) a quasi-quadric is a set of points that has the same intersection numbers with respect to… Expand
Highly Cited
1999
Highly Cited
1999
We analyze the model-checking problems for safety and liveness properties in parameterized broadcast protocols. We show that the… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
1985
1985
Easy proofs are given, of the impossibility of solving several consensus problems (Byzantine agreement, weak agreement, Byzantine… Expand
Highly Cited
1976
Highly Cited
1976
  • C. Platt
  • J. Comb. Theory, Ser. B
  • 1976
  • Corpus ID: 205021252
Abstract It is shown that a finite lattice is planar if and only if the (undirected) graph obtained from its (Hasse) diagram by… Expand
  • figure 1
  • figure 2
  • figure 4
  • figure 5
  • figure 6