Sciweavers

270 search results - page 29 / 54
» Matching graphs of Hypercubes and Complete Bipartite Graphs
Sort
View
DAM
2011
13 years 3 months ago
Matchability and k-maximal matchings
We present a collection of new structural, algorithmic, and complexity results for two types of matching problems. The first problem involves the computation of k-maximal matchin...
Brian C. Dean, Sandra Mitchell Hedetniemi, Stephen...
ICDCS
2009
IEEE
14 years 5 months ago
A Note on Distributed Stable Matching
We consider the distributed complexity of the stable marriage problem. In this problem, the communication graph is undirected and bipartite, and each node ranks its neighbors. Giv...
Alex Kipnis, Boaz Patt-Shamir
DMTCS
2010
157views Mathematics» more  DMTCS 2010»
13 years 6 months ago
Edge-Removal and Non-Crossing Configurations in Geometric Graphs
A geometric graph is a graph G = (V, E) drawn in the plane, such that V is a point set in general position and E is a set of straight-line segments whose endpoints belong to V . W...
Oswin Aichholzer, Sergio Cabello, Ruy Fabila Monro...
JCO
2007
113views more  JCO 2007»
13 years 8 months ago
Recent progress in mathematics and engineering on optimal graph labellings with distance conditions
The problem of radio channel assignments with multiple levels of interference can be modelled using graph theory. The theory of integer vertex-labellings of graphs with distance c...
Jerrold R. Griggs, Xiaohua Teresa Jin
COMBINATORICS
2006
130views more  COMBINATORICS 2006»
13 years 8 months ago
Fractional Biclique Covers and Partitions of Graphs
A biclique is a complete bipartite subgraph of a graph. This paper investigates the fractional biclique cover number, bc(G), and the fractional biclique partition number, bp(G), o...
Valerie L. Watts