Sciweavers

145 search results - page 10 / 29
» A new characterization of HH-free graphs
Sort
View
FSTTCS
2010
Springer
14 years 7 months ago
The effect of girth on the kernelization complexity of Connected Dominating Set
In the Connected Dominating Set problem we are given as input a graph G and a positive integer k, and are asked if there is a set S of at most k vertices of G such that S is a dom...
Neeldhara Misra, Geevarghese Philip, Venkatesh Ram...
BMCBI
2008
116views more  BMCBI 2008»
14 years 9 months ago
A novel representation of RNA secondary structure based on element-contact graphs
Background: Depending on their specific structures, noncoding RNAs (ncRNAs) play important roles in many biological processes. Interest in developing new topological indices based...
Wenjie Shu, Xiaochen Bo, Zhiqiang Zheng, Shengqi W...
ENTCS
2008
153views more  ENTCS 2008»
14 years 9 months ago
Efficient Conflict Detection in Graph Transformation Systems by Essential Critical Pairs
The well-known notion of critical pairs already allows a static conflict detection, which is important for all kinds of applications and already implemented in AGG. Unfortunately ...
Leen Lambers, Hartmut Ehrig, Fernando Orejas
EUROMICRO
2003
IEEE
15 years 2 months ago
Web Service Composition Languages: Old Wine in New Bottles?
Recently, several languages for web service composition have emerged (e.g., BPEL4WS and WSCI). The goal of these languages is to glue web services together in a process-oriented w...
Wil M. P. van der Aalst, Marlon Dumas, Arthur H. M...
IM
2007
14 years 9 months ago
Growing Protean Graphs
Abstract. The web may be viewed as a graph each of whose vertices corresponds to a static HTML web page, and each of whose edges corresponds to a hyperlink from one web page to ano...
Pawel Pralat, Nicholas C. Wormald