266 search results - page 13 / 54 » Graphs with Bounded Induced Distance |
JUCS
2007
13 years 8 months ago
2007
: In this paper, we study spectral versions of the densest subgraph problem and the largest independence subset problem. In the first part, we give an algorithm for identifying sm...
GC
2008
Springer
13 years 9 months ago
2008
Springer
An acyclic coloring of a graph G is a proper coloring of the vertex set of G such that G contains no bichromatic cycles. The acyclic chromatic number of a graph G is the minimum nu...
SPAA
2005
ACM
14 years 2 months ago
2005
ACM
A weighted undirected network is ∆ growth-bounded if the number of nodes at distance 2r around any given node is at most ∆ times the number of nodes at distance r around the n...
AAAI
2007
13 years 11 months ago
2007
We study the behavior of the classical A∗ search algorithm when coupled with a heuristic that provides estimates, accurate to within a small multiplicative factor, of the distan...
CORR
2008
Springer
13 years 9 months ago
2008
Springer
"THIS PAPER IS ELIGIBLE FOR THE STUDENT PAPER AWARD" Let Aq(n, d) be the maximum order (maximum number of codewords) of a q-ary code of length n and Hamming distance at l...