6740 search results - page 52 / 1348 » An s -Hamiltonian Line Graph Problem |
ATMOS
2008
13 years 9 months ago
2008
One of the basic problems in strategic planning of public and rail transport is the line planning problem to find a system of lines and its associated frequencies. The objectives o...
DAM
2008
13 years 7 months ago
2008
A clique-transversal of a graph G is a subset of vertices that meets all the cliques of G. A clique-independent set is a collection of pairwise vertex-disjoint cliques. The clique...
JGAA
2010
13 years 6 months ago
2010
We investigate which chordal graphs have a representation as intersection graphs of pseudosegments. For positive we have a construction which shows that all chordal graphs that ca...
SIAMCOMP
1998
13 years 7 months ago
1998
This paper first presents a unified approach to design efficient algorithms for the weighted domination problem and its three variants, i.e., the weighted independent, connected,...
CAIP
2009
Springer
13 years 11 months ago
2009
Springer
Abstract. In this paper we propose a new approach to improve electronic editions of literary corpus, providing an efficient estimation of manuscripts pages structure. In any handwr...