Results 41 to 50 of about 104 (103)
A Metaheuristic Approach to Solving the Generalized Vertex Cover Problem [PDF]
, 2010 AMS Subj. Classification: 90C27, 05C85, 90C59The topic is related to solving the generalized vertex cover problem (GVCP) by genetic algorithm. The problem is NP-hard as a generalization of well-known vertex cover problem which was one of the first problems
Milanović, Marija
core
A $4/3$ Approximation for $2$-Vertex-Connectivity [PDF]
TheoretiCSThe 2-Vertex-Connected Spanning Subgraph problem (2VCSS) is among the most basic NP-hard (Survivable) Network Design problems: we are given an (unweighted) undirected graph $G$.
Miguel Bosch-Calvo +2 more
doaj +1 more source
Faster parameterized algorithms for modification problems to minor-closed classes [PDF]
TheoretiCSLet ${\cal G}$ be a minor-closed graph class and let $G$ be an $n$-vertex graph. We say that $G$ is a $k$-apex of ${\cal G}$ if $G$ contains a set $S$ of at most $k$ vertices such that $G\setminus S$ belongs to ${\cal G}$.
Laure Morelle +3 more
doaj +1 more source
The generalizedp-Centdian on network
Location, Centdian, Networks, 68Q20, 68R99, 05C85, 90C35,
Dionisio Brito, José Moreno Pérez
core +1 more source
Gossiping in circulant graphs [PDF]
, 2014 Investiguem el problema de fer safareig, en el qual els nodes d'una xarxad'intercomunicació comparteixen informació mitjançant un protocol de comunicació per rondes.
Romain Gay; ENS Cachan, Paris
core +1 more source
Fast algorithms for determining (generalized) core groups in social networks
Core, Large network, Decomposition, Graph algorithm, 05A18, 05C70, 05C85, 05C90, 68R10, 68W40, 92H30, 92G30, 93A15,
Vladimir Batagelj, Matjaž Zaveršnik
core +1 more source
, 2008 We define the harmonic evolution of states of a graph by iterative application of the harmonic operator (Laplacian over Z2). This provides graphs with a new geometric context and leads to a new tool to analyze them.
Jerzy Kocik
core
The Serial Transitive Closure Problem for Trees
, 2002 The serial transitive closure problem is the problem of, given a directed graph G and a list of edges, called closure edges, which are in the transitive closure of the graph, to generate all the closure edges from edges in G.
core
Continuous facility location on graphs. [PDF]
Math Program, 2022 Hartmann TA, Lendl S, Woeginger GJ.
europepmc +1 more source
Edge Colouring Reduced Indifference Graphs
, 1999 The chromatic index problem -- finding the minimum number of colours required for colouring the edges of a graph -- is still unsolved for indifference graphs, whose vertices can be linearly ordered so that the vertices contained in the same maximal ...
Celina M. H. De Figueiredo +3 more
core