31 search results - page 5 / 7 » Improper choosability of graphs and maximum average degree |
WICON
2008
13 years 8 months ago
2008
It is well known that the maximum weighted independent set (MWIS) problem is NP-complete. Moreover, optimal scheduling in wireless networks requires solving a MWIS problem. Conseq...
STACS
2004
Springer
14 years 24 days ago
2004
Springer
We present an improved average case analysis of the maximum cardinality matching problem. We show that in a bipartite or general random graph on n vertices, with high probability ...
JAIR
1998
13 years 7 months ago
1998
Using an improved backtrack algorithm with sophisticated pruning techniques, we revise previous observations correlating a high frequency of hard to solve Hamiltonian cycle instan...
WEA
2005
Springer
14 years 28 days ago
2005
Springer
This work is motivated by the long-standing open problem of designing a polynomial-time algorithm that with high probability constructs an asymptotically maximum independent set in...
JGT
2008
13 years 7 months ago
2008
A spanning subgraph G of a graph H is a k-detour subgraph of H if for each pair of vertices x, y V (H), the distance, distG(x, y), between x and y in G exceeds that in H by at mo...