6740 search results - page 300 / 1348 » An s -Hamiltonian Line Graph Problem |
114
click to vote
DM
2002
15 years 3 months ago
2002
Let ir(G) and (G) be the irredundance number and the domination number of a graph G, respectively. A graph G is called irredundance perfect if ir(H) = (H), for every induced subgr...
126
click to vote
MICS
2010
14 years 10 months ago
2010
In this paper we consider the k-fixed-endpoint path cover problem on proper interval graphs, which is a generalization of the path cover problem. Given a graph G and a set T of k v...
116
click to vote
SIGSOFT
2009
ACM
16 years 4 months ago
2009
ACM
Programs of a software product line can be synthesized by composing features which implement a unit of program functionality. In most product lines, only some combination of featu...
135
click to vote
TAMC
2009
Springer
15 years 10 months ago
2009
Springer
We study a new model of computation called stream checking on graph problems where a space-limited verifier has to verify a proof sequentially (i.e., it reads the proof as a strea...
142
click to vote
GD
1997
Springer
15 years 8 months ago
1997
Springer
Although routing is a well-studied problem in various contexts, there remain unsolved problems in routing edges for graph layouts. In contrast with techniques from other domains su...