Sciweavers

406 search results - page 27 / 82
» Dominating Sets in Web Graphs
Sort
View
SMA
2008
ACM
172views Solid Modeling» more  SMA 2008»
13 years 9 months ago
Guarding curvilinear art galleries with edge or mobile guards
In this paper we consider the problem of monitoring an art gallery modeled as a polygon, the edges of which are arcs of curves. We consider two types of guards: edge guards (these...
Menelaos I. Karavelas
DAM
1999
119views more  DAM 1999»
13 years 8 months ago
On the Algorithmic Complexity of Twelve Covering and Independence Parameters of Graphs
The definitions of four previously studied parameters related to total coverings and total matchings of graphs can be restricted, thereby obtaining eight parameters related to cov...
David Manlove
ICWS
2008
IEEE
13 years 10 months ago
An Efficient Syntactic Web Service Composition Algorithm Based on the Planning Graph Model
In this paper, we have studied a common Web service composition problem, the syntactic matching problem, where the output parameters of a Web service can be used as the input para...
Xianrong Zheng, Yuhong Yan
ICWE
2005
Springer
14 years 2 months ago
Identifying Websites with Flow Simulation
We present in this paper a method to discover the set of webpages contained in a logical website, based on the link structure of the Web graph. Such a method is useful in the conte...
Pierre Senellart
WG
2010
Springer
13 years 7 months ago
max-cut and Containment Relations in Graphs
book Author Title 58 Bijo S Anand Atoms and clique separators in graph products 59 Asir T Domination in total graph of a commutative ring 60 Sharada B On the Neighbourhood Subdivi...
Marcin Kaminski