Sciweavers

400 search results - page 18 / 80
» On some Properties of DNA Graphs
Sort
View
DM
2008
116views more  DM 2008»
14 years 11 months ago
Breaking the rhythm on graphs
We study graph colorings avoiding periodic sequences with large number of blocks on paths. The main problem is to decide, for a given class of graphs F, if there are absolute const...
Noga Alon, Jaroslaw Grytczuk
AI
2010
Springer
14 years 12 months ago
Optimal query complexity bounds for finding graphs
We consider the problem of finding an unknown graph by using two types of queries with an additive property. Given a graph, an additive query asks the number of edges in a set of ...
Sung-Soon Choi, Jeong Han Kim
CPC
2010
74views more  CPC 2010»
14 years 9 months ago
Playing to Retain the Advantage
Let P be a monotone increasing graph property, let G = (V, E) be a graph, and let q be a positive integer. In this paper, we study the (1 : q) Maker-Breaker game, played on the ed...
Noga Alon, Dan Hefetz, Michael Krivelevich
GECCO
2003
Springer
15 years 5 months ago
Investigation of the Fitness Landscapes and Multi-parent Crossover for Graph Bipartitioning
An empirical study is performed on the local-optimum space of graph bipartitioning. We examine some statistical features of the fitness landscape. They include the cost-distance c...
Yong-Hyuk Kim, Byung Ro Moon
CSC
2006
15 years 1 months ago
Finding Hamilton Circuit in a Graph
- The purpose of this paper is to develop an algorithm to determine the Hamilton Circuit in a given graph of degree three. This algorithm will find Hamilton Circuit in polynomial s...
Ghulam Mustafa Babar, Malik Sikander Hayat Khiyal,...