1736 search results - page 190 / 348 » On antimagic directed graphs |
184
click to vote
DAM
2000
15 years 6 months ago
2000
Feedback problems consist of removing a minimal number of vertices of a directed or undirected graph in order to make it acyclic. The problem is known to be NPcomplete. In this pa...
161
click to vote
AAAI
2008
15 years 8 months ago
2008
Recent advances in classical planning have used the SAS+ formalism, and several effective heuristics have been developed based on the SAS+ formalism. Comparing to the traditional ...
149
click to vote
KRDB
1998
15 years 7 months ago
1998
Previous researchers note the problem for semantic optimisation of database queries caused by its production of a large number of semantically equivalent alternative queries, from...
181
click to vote
DAM
2010
15 years 6 months ago
2010
For all integers k 3, we give an O(n4 ) time algorithm for the problem whose instance is a graph G of girth at least k together with k vertices and whose question is "Does G...
162
click to vote
AAAI
2007
15 years 8 months ago
2007
We introduce a distributed negotiation framework for multiagent resource allocation where interactions between agents are limited by a graph defining a negotiation topology. A gr...