779 search results - page 118 / 156 » A graph polynomial for independent sets of bipartite graphs |
179
click to vote
COMBINATORICS
1998
15 years 5 months ago
1998
A multimatroid is a combinatorial structure that encompasses matroids, delta-matroids and isotropic systems. This structure has been introduced to unify a theorem of Edmonds on th...
177
click to vote
ISAAC
2009
Springer
16 years 21 days ago
2009
Springer
Abstract. Connected dominating set (CDS) has a wide range of applications in wireless ad hoc networks. A number of approximation algorithms for constructing a small CDS in wireless...
142
click to vote
ARSCOM
2002
15 years 6 months ago
2002
In 1973, Deuber published his famous proof of Rado's conjecture regarding partition regular sets. In his proof, he invented structures called (m, p, c)-sets and gave a partit...
178
click to vote
AICCSA
2007
IEEE
16 years 15 days ago
2007
IEEE
In the maximum common subgraph (MCS) problem, we are given a pair of graphs and asked to find the largest induced subgraph common to them both. With its plethora of applications,...
158
click to vote
STOC
2005
ACM
16 years 6 months ago
2005
ACM
The Write-All problem for an asynchronous shared-memory system has the objective for the processes to update the contents of a set of shared registers, while minimizing the mber o...