601 search results - page 47 / 121 » Edge-dominating cycles in graphs |
GC
2008
Springer
13 years 8 months ago
2008
Springer
For a directed graph G without loops or parallel edges, let (G) denote the size of the smallest feedback arc set, i.e., the smallest subset X E(G) such that G \ X has no directed...
LPAR
2005
Springer
14 years 2 months ago
2005
Springer
Separation logic is a subset of the quantifier-free first order logic. It has been successfully used in the automated verification of systems that have large (or unbounded) inte...
ARSCOM
2004
13 years 8 months ago
2004
We show that in any graph G on n vertices with d(x) + d(y) n for any two nonadjacent vertices x and y, we can fix the order of k vertices on a given cycle and find a hamiltonian c...
CSR
2010
Springer
14 years 2 days ago
2010
Springer
Abstract. The Hamiltonian cycle problem (HCP) is an important combinatorial problem with applications in many areas. While thorough theoretical and experimental analyses have been ...
ISPAN
2008
IEEE
14 years 3 months ago
2008
IEEE
Intuitively, a signed graph is a graph in which every edge is labeled with a + or − sign. For each edge, its sign represents the mode of the relationship between the vertices it...