721 search results - page 40 / 145 » Bounds on the k-domination number of a graph |
115
click to vote
WG
1998
Springer
15 years 6 months ago
1998
Springer
In this work we introduce the class of graphs with bounded induced distance of order k, (BID(k) for short). A graph G belongs to BID(k) if the distance between any two nodes in ev...
111
click to vote
STOC
1997
ACM
15 years 6 months ago
1997
ACM
We consider exploration problems where a robot has to construct a complete map of an unknown environment. We assume that the environment is modeled by a directed, strongly connecte...
135
click to vote
SODA
2012
ACM
13 years 4 months ago
2012
ACM
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 ...
ICANNGA
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. Chromatic number, chromatic sum and chromatic sum number are important graph coloring characteristics. The paper proves that a parallel metaheuristic like the parallel ge...
109
click to vote
PODS
2006
ACM
16 years 2 months ago
2006
ACM
Given that most elementary problems in database design are NP-hard, the currently used database design algorithms produce suboptimal results. For example, the current 3NF decompos...