Sciweavers

820 search results - page 117 / 164
» Inducing Temporal Graphs
Sort
View
ACID
2006
220views Algorithms» more  ACID 2006»
13 years 10 months ago
Vertex and Edge Covers with Clustering Properties: Complexity and Algorithms
We consider the concepts of a t-total vertex cover and a t-total edge cover (t 1), which generalize the notions of a vertex cover and an edge cover, respectively. A t-total verte...
Henning Fernau, David Manlove
DM
2008
73views more  DM 2008»
13 years 8 months ago
A note on edge-graceful spectra of the square of paths
For a simple path Pr on r vertices, the square of Pr is the graph P2 r on the same set of vertices of Pr , and where every pair of vertices of distance two or less in Pr is connec...
Tao-Ming Wang, Cheng-Chih Hsiao, Sin-Min Lee
IANDC
2006
97views more  IANDC 2006»
13 years 8 months ago
Pure bigraphs: Structure and dynamics
Abstract Bigraphs are graphs whose nodes may be nested, representing locality, independently of the edges connecting them. They may be equipped with reaction rules, forming a bigra...
Robin Milner
JAIR
2008
111views more  JAIR 2008»
13 years 8 months ago
New Islands of Tractability of Cost-Optimal Planning
We study the complexity of cost-optimal classical planning over propositional state variables and unary-effect actions. We discover novel problem fragments for which such optimiza...
Michael Katz, Carmel Domshlak
TCS
2008
13 years 8 months ago
Approximation algorithms for partially covering with edges
The edge dominating set (EDS) and edge cover (EC) problems are classical graph covering problems in which one seeks a minimum cost collection of edges which covers the edges or ve...
Ojas Parekh