Wyniki wyszukiwania dla: K -PATH VERTEX COVER
-
Some variations of perfect graphs
PublikacjaWe consider (ψk−γk−1)-perfect graphs, i.e., graphs G for which ψk(H) =γk−1(H) for any induced subgraph H of G, where ψk and γk−1 are the k -path vertex cover number and the distance (k−1)-domination number, respectively. We study (ψk−γk−1)-perfect paths, cycles and complete graphs for k≥2. Moreover, we provide a complete characterisation of (ψ2−γ1)-perfect graphs describing the set of its forbidden induced subgraphs and providing...
-
Similarities and Differences Between the Vertex Cover Number and the Weakly Connected Domination Number of a Graph
PublikacjaA vertex cover of a graph G = (V, E) is a set X ⊂ V such that each edge of G is incident to at least one vertex of X. The ve cardinality of a vertex cover of G. A dominating set D ⊆ V is a weakly connected dominating set of G if the subgraph G[D]w = (N[D], Ew) weakly induced by D, is connected, where Ew is the set of all edges having at least one vertex in D. The weakly connected domination number γw(G) of G is the minimum cardinality...
-
Some variants of perfect graphs related to the matching number, the vertex cover and the weakly connected domination number
PublikacjaGiven two types of graph theoretical parameters ρ and σ, we say that a graph G is (σ, ρ)- perfect if σ(H) = ρ(H) for every non-trivial connected induced subgraph H of G. In this work we characterize (γw, τ )-perfect graphs, (γw, α′)-perfect graphs, and (α′, τ )-perfect graphs, where γw(G), τ (G) and α′(G) denote the weakly connected domination number, the vertex cover number and the matching number of G, respectively. Moreover,...
-
Parity vertex colouring of graphs
PublikacjaA parity path in a vertex colouring of a graph is a path along which each colour is used an even number of times. Let Xp(G) be the least number of colours in a proper vertex colouring of G having no parity path. It is proved that for any graph G we have the following tight bounds X(G) <= Xp(G) <=|V(G)|− a(G)+1, where X(G) and a(G) are the chromatic number and the independence number of G, respectively. The bounds are improved for...
-
Dynamic F-free Coloring of Graphs
PublikacjaA problem of graph F-free coloring consists in partitioning the vertex set of a graph such that none of the resulting sets induces a graph containing a fixed graph F as an induced subgraph. In this paper we consider dynamic F-free coloring in which, similarly as in online coloring, the graph to be colored is not known in advance; it is gradually revealed to the coloring algorithm that has to color each vertex upon request as well...
-
Exploiting multi-interface networks: Connectivity and Cheapest Paths
PublikacjaLet G = (V,E) be a graph which models a set of wireless devices (nodes V) that can communicate by means of multiple radio interfaces, according to proximity and common interfaces (edges E). The problem of switching on (activating) the minimum cost set of interfaces at the nodes in order to guarantee the coverage of G was recently studied. A connection is covered (activated) when the endpoints of the corresponding edge share at...
-
Cops, a fast robber and defensive domination on interval graphs
PublikacjaThe game of Cops and ∞-fast Robber is played by two players, one controlling c cops, the other one robber. The players alternate in turns: all the cops move at once to distance at most one each, the robber moves along any cop-free path. Cops win by sharing a vertex with the robber, the robber by avoiding capture indefinitely. The game was proposed with bounded robber speed by Fomin et al. in “Pursuing a fast robber on a graph”,...
-
On-line ranking of split graphs
PublikacjaA vertex ranking of a graph G is an assignment of positive integers (colors) to the vertices of G such that each path connecting two vertices of the same color contains a vertex of a higher color. Our main goal is to find a vertex ranking using as few colors as possible. Considering on-line algorithms for vertex ranking of split graphs, we prove that the worst case ratio of the number of colors used by any on-line ranking algorithm...
-
Constant-Factor Approximation Algorithm for Binary Search in Trees with Monotonic Query Times
PublikacjaWe consider a generalization of binary search in linear orders to the domain of weighted trees. The goal is to design an adaptive search strategy whose aim is to locate an unknown target vertex of a given tree. Each query to a vertex v incurs a non-negative cost ω(v) (that can be interpreted as the duration of the query) and returns a feedback that either v is the target or the edge incident to v is given that is on the path towards...
-
Sea surface temperature in the Baltic Sea derived from Landsat 8 satellite data - path 194
Dane BadawczeThe data set contains high resolution sea surface temperature (SST) maps estimated from Landsat 8 Level 1 Thermal Infrared Sensor (TIRS) data using NLSST algorithm. SST was calculated only for granules (185 x 180 km) from satellite path number 194, that covered at least 2000 km2 of the cloud-free area of the Baltic Sea.
-
Sea surface temperature in the Baltic Sea derived from Landsat 8 satellite data - path 192
Dane BadawczeThe data set contains high resolution sea surface temperature (SST) maps estimated from Landsat 8 Level 1 Thermal Infrared Sensor (TIRS) data using NLSST algorithm. SST was calculated only for granules (185 x 180 km) from satellite path number 192, that covered at least 2000 km2 of the cloud-free area of the Baltic Sea.
-
Sea surface temperature in the Baltic Sea derived from Landsat 8 satellite data - path 191
Dane BadawczeThe data set contains high resolution sea surface temperature (SST) maps estimated from Landsat 8 Level 1 Thermal Infrared Sensor (TIRS) data using NLSST algorithm. SST was calculated only for granules (185 x 180 km) from satellite path number 191, that covered at least 2000 km2 of the cloud-free area of the Baltic Sea.
-
Sea surface temperature in the Baltic Sea derived from Landsat 8 satellite data - path 193
Dane BadawczeThe data set contains high resolution sea surface temperature (SST) maps estimated from Landsat 8 Level 1 Thermal Infrared Sensor (TIRS) data using NLSST algorithm. SST was calculated only for granules (185 x 180 km) from satellite path number 193, that covered at least 2000 km2 of the cloud-free area of the Baltic Sea.
-
Sea surface temperature in the Baltic Sea derived from Landsat 8 satellite data - path 190
Dane BadawczeThe data set contains high resolution sea surface temperature (SST) maps estimated from Landsat 8 Level 1 Thermal Infrared Sensor (TIRS) data using NLSST algorithm. SST was calculated only for granules (185 x 180 km) from satellite path number 190, that covered at least 2000 km2 of the cloud-free area of the Baltic Sea.
-
2-outer-independent domination in graphs
PublikacjaWe initiate the study of 2-outer-independent domination in graphs. A 2-outer-independent dominating set of a graph G is a set D of vertices of G such that every vertex of V(G)\D has at least two neighbors in D, and the set V(G)\D is independent. The 2-outer-independent domination number of a graph G is the minimum cardinality of a 2-outer-independent dominating set of G. We show that if a graph has minimum degree at least two,...
-
An Efficient Noisy Binary Search in Graphs via Median Approximation
PublikacjaConsider a generalization of the classical binary search problem in linearly sorted data to the graph-theoretic setting. The goal is to design an adaptive query algorithm, called a strategy, that identifies an initially unknown target vertex in a graph by asking queries. Each query is conducted as follows: the strategy selects a vertex q and receives a reply v: if q is the target, then =, and if q is not the target, then v is a...
-
The convex domination subdivision number of a graph
PublikacjaLet G = (V;E) be a simple graph. A set D\subset V is a dominating set of G if every vertex in V - D has at least one neighbor in D. The distance d_G(u, v) between two vertices u and v is the length of a shortest (u, v)-path in G. An (u, v)-path of length d_G(u; v) is called an (u, v)-geodesic. A set X\subset V is convex in G if vertices from all (a, b)-geodesics belong to X for any two vertices a, b \in X. A set X is a convex dominating...
-
Preliminary estimation of groundwater recharge on Brda river outwash plain
PublikacjaEstimation of groundwater recharge is one of the most challenging subjects in hydrogeology. It is a critical factor influencing the pollution migration, assessment of aquifer vulnerability to contamination, small-scale groundwater budget calculation, modeling of nutrient cycling and detailed flow path calculations. In Poland an infiltration rate method is widely used, which depends on a system of rate coefficients referring to...
-
A Framework for Searching in Graphs in the Presence of Errors
PublikacjaWe consider a problem of searching for an unknown target vertex t in a (possibly edge-weighted) graph. Each vertex-query points to a vertex v and the response either admits that v is the target or provides any neighbor s of v that lies on a shortest path from v to t. This model has been introduced for trees by Onak and Parys [FOCS 2006] and for general graphs by Emamjomeh-Zadeh et al. [STOC 2016]. In the latter, the authors provide...
-
Grade of service determination methodology in IP networks with SIP protocol
PublikacjaAlthough Grade of Service is very important in VoIP providers evaluation, We wasn't able to find any paper regarding the topic of measuring GoS variables for IP networks utilizing SIP, which are defined like for PSTN/ISDN/GSM networks (post-selection delay, answering delay, release delay, or probability of end-to-end blocking). Due to the lack of research in this field, it was necessary to start from defining measures and cover...