Sciweavers

820 search results - page 43 / 164
» Inducing Temporal Graphs
Sort
View
JDA
2010
122views more  JDA 2010»
13 years 3 months ago
Subexponential parameterized algorithms for degree-constrained subgraph problems on planar graphs
We present subexponential parameterized algorithms on planar graphs for a family of problems of the following shape: given a graph, find a connected (induced) subgraph with bounde...
Ignasi Sau, Dimitrios M. Thilikos
TIME
2007
IEEE
14 years 2 months ago
Temporal Relations of Intervals with a Gap
Forty-four relations are found between an interval and an interval with a gap ( rIIg ), capturing semantics that are distinct from those of the sets of constituting intervals and ...
Max J. Egenhofer
CIBB
2009
13 years 9 months ago
On the Use of Temporal Formal Logic to Model Gene Regulatory Networks
Modelling activities in molecular biology face the difficulty of prediction to link molecular knowledge with cell phenotypes. Even when the interaction graph between molecules is k...
Gilles Bernot, Jean-Paul Comet
GPEM
2007
95views more  GPEM 2007»
13 years 8 months ago
Where is evolutionary computation going? A temporal analysis of the EC community
Studying an evolving complex system and drawing some conclusions from it is an integral part of nature-inspired computing; being a part of that complex system, some insight can als...
Carlos Cotta, Juan Julián Merelo Guerv&oacu...
WG
2007
Springer
14 years 2 months ago
Proper Helly Circular-Arc Graphs
A circular-arc model M = (C, A) is a circle C together with a collection A of arcs of C. If no arc is contained in any other then M is a proper circular-arc model, if every arc has...
Min Chih Lin, Francisco J. Soulignac, Jayme Luiz S...