Sciweavers

6598 search results - page 12 / 1320
» Graph Theory with Applications
Sort
View
STOC
2005
ACM
96views Algorithms» more  STOC 2005»
15 years 12 months ago
Every monotone graph property is testable
A graph property is called monotone if it is closed under taking (not necessarily induced) subgraphs (or, equivalently, if it is closed under removal of edges and vertices). Many ...
Noga Alon, Asaf Shapira
DM
2010
107views more  DM 2010»
14 years 11 months ago
An analytic approach to stability
The stability method is very useful for obtaining exact solutions of many extremal graph problems. Its key step is to establish the stability property which, roughly speaking, sta...
Oleg Pikhurko
JCO
2007
113views more  JCO 2007»
14 years 11 months ago
Recent progress in mathematics and engineering on optimal graph labellings with distance conditions
The problem of radio channel assignments with multiple levels of interference can be modelled using graph theory. The theory of integer vertex-labellings of graphs with distance c...
Jerrold R. Griggs, Xiaohua Teresa Jin
GG
2010
Springer
15 years 23 days ago
Local Confluence for Rules with Nested Application Conditions
Abstract. Local confluence is an important property in many rewriting and transformation systems. The notion of critical pairs is central for being able to verify local confluence ...
Hartmut Ehrig, Annegret Habel, Leen Lambers, Ferna...
GECCO
2005
Springer
130views Optimization» more  GECCO 2005»
15 years 5 months ago
Hybrid real-coded mutation for genetic algorithms applied to graph layouts
In this paper we introduce an application of real-coded genetic algorithms to the problem of consistent graph layout and exploring the role of mutation for this particular problem...
Dana Vrajitoru, Jason DeBoni