Sciweavers

1461 search results - page 73 / 293
» Complexity of Graph Covering Problems
Sort
View
AAAI
2008
15 years 5 days ago
Multiagent Graph Coloring: Pareto Efficiency, Fairness and Individual Rationality
We consider a multiagent extension of single-agent graph coloring. Multiple agents hold disjoint autonomous subgraphs of a global graph, and every color used by the agents in colo...
Yaad Blum, Jeffrey S. Rosenschein
AIPS
2008
15 years 5 days ago
Causal Graphs and Structurally Restricted Planning
The causal graph is a directed graph that describes the variable dependencies present in a planning instance. A number of papers have studied the causal graph in both practical an...
Hubie Chen, Omer Giménez
WG
2010
Springer
14 years 8 months ago
On the Small Cycle Transversal of Planar Graphs
We consider the problem of finding a k-edge transversal set that covers all (simple) cycles of length at most s in a planar graph, where s ≥ 3 is a constant. This problem, refe...
Ge Xia, Yong Zhang
ICST
2008
IEEE
15 years 4 months ago
Efficient Test Data Generation for Variables with Complex Dependencies
This paper introduces a new method for generating test data that combines the benefits of equivalence partitioning, boundary value analysis and cause-effect analysis. It is suitab...
Armin Beer, Stefan Mohacsi
IPPS
2010
IEEE
14 years 7 months ago
Large scale complex network analysis using the hybrid combination of a MapReduce cluster and a highly multithreaded system
Complex networks capture interactions among entities in various application areas in a graph representation. Analyzing large scale complex networks often answers important question...
Seunghwa Kang, David A. Bader