Given a class of graphs F, we say that a graph G is universal for F, or F-universal, if every H ∈ F is contained in G as a subgraph. The construction of sparse universal graphs ...
Daniel Johannsen, Michael Krivelevich, Wojciech Sa...
: We consider a well known distributed coloring game played on a simple connected graph: initially, each vertex is colored black or white; at each round, each vertex simultaneously...
A bipartite concentrator is a single stage sparse crossbar switching device that can connect any m of its n ≥ m inputs to its m outputs possibly without the ability to distingui...
In the area of depth estimation from images an interesting approach has been structure recovery from defocus cue. Towards this end, there have been a number of approaches [4, 6]. ...
Vinay P. Namboodiri, Subhasis Chaudhuri, Sunil Had...
Given a graph G=(V, E) on n vertices, the MAXIMUM r-REGULAR INDUCED SUBGRAPH (M-r-RIS) problems ask for a maximum sized subset of vertices R V such that the induced subgraph on R,...