Results 1 to 10 of about 142,209 (249)
ISPRS International Journal of Geo-Information, 2019 With the rapid development of the economy, urgent needs for 3-D Geographical Information System (GIS) have sprung up in many application fields. The precise expression of three-dimensional topological relations is the foundation of spatial analysis ...
Mengyun Zhou, Qingfeng Guan
doaj +1 more source
, 2020 We show that {\sc Vertex Cover} remains difficult if one restricts the number of vertices $|V|$, the number of edges $|E|$ and the size of wanted solution $k$ to be powers of $2$.
openaire +1 more source
Vertex adjacencies in the set covering polyhedron
Discrete Applied Mathematics, 2017 We describe the adjacency of vertices of the (unbounded version of the) set covering polyhedron, in a similar way to the description given by Chvatal for the stable set polytope. We find a sufficient condition for adjacency, and characterize it with similar conditions in the case where the underlying matrix is row circular.
Aguilera, Néstor Edgardo +2 more
openaire +4 more sources
Vertex coverings by monochromatic cycles and trees
Journal of Combinatorial Theory, Series B, 1991 \textit{A. Gyárfás} [Irregularities of partitions, Pap. Meet., Fertod/Hung. 1986, Algorithms Comb. 8, 89-91 (1989; Zbl 0736.05062)] conjectured that if the edges of a complete graph \(K\) are colored with \(r\) colors then, for some function \(f\), the vertex set of \(K\) can be covered by at most \(f(r)\) vertex disjoint monochromatic paths.
L. Pyber, Paul Erdős, András Gyárfás
openaire +2 more sources
Bounds on the Clique and the Independence Number for Certain Classes of Graphs
MathematicsIn this paper, we study the class of graphs Gm,n that have the same degree sequence as two disjoint cliques Km and Kn, as well as the class G¯m,n of the complements of such graphs.
Valentin E. Brimkov, Reneta P. Barneva
doaj +1 more source
Layered Graphs: Applications and Algorithms
Algorithms, 2018 The computation of distances between strings has applications in molecular biology, music theory and pattern recognition. One such measure, called short reversal distance, has applications in evolutionary distance computation. It has been shown that this
Bhadrachalam Chitturi +3 more
doaj +1 more source
Generation of minimal vertex covers for row/column allocation in self-repairable arrays [PDF]
, 1996 MYLES SMITH, Pinaki Mazumder
openalex +1 more source
Connected vertex covers in dense graphs
Theoretical Computer Science, 2008 AbstractWe consider the variant of the minimum vertex cover problem in which we require that the cover induces a connected subgraph. We give new approximation results for this problem in dense graphs, in which either the minimum or the average degree is linear.
Cardinal, Jean, Levy, Eythan
openaire +3 more sources
Minimal vertex covers on finite-connectivity random graphs: A hard-sphere lattice-gas picture [PDF]
, 2001 Martin Weigt, Alexander K. Hartmann
openalex +1 more source
, 2019 Our problem is a variant of the well-known \textsc{Vertex Cover} problem. In our problem, a vertex cover is already given, our task is to decide whether the given solution is optimal, i.e., minimum. This is to show that any purported heuristic algorithm needs something more novel.
openaire +1 more source