Wyniki wyszukiwania dla: K -PATH VERTEX COVER - MOST Wiedzy

Wyszukiwarka

Wyniki wyszukiwania dla: K -PATH VERTEX COVER

Filtry

wszystkich: 93
wybranych: 55

wyczyść wszystkie filtry


Filtry wybranego katalogu

  • Kategoria

  • Rok

  • Opcje

wyczyść Filtry wybranego katalogu niedostępne

Wyniki wyszukiwania dla: K -PATH VERTEX COVER

  • Minimum vertex ranking spanning tree problem for chordal and proper interval graphs

    W pracy rozważamy problem szukania, dla danego grafu prostego, drzewa spinającego, którego uporządkowana liczba chromatyczna jest minimalna. K.~Miyata i inni dowiedli w [Np-hardness proof and an approximation algorithm for the minimum vertex ranking spanning tree problem,Discrete Appl. Math. 154 (2006) 2402-2410], że odpowiedni problem decyzyjny jest NP-trudny już w przypadku pytania o istnienie uporządkowanego 4-pokolorowania....

    Pełny tekst do pobrania w portalu

  • Strategic balance in graphs

    For a given graph G, a nonempty subset S contained in V ( G ) is an alliance iff for each vertex v ∈ S there are at least as many vertices from the closed neighbourhood of v in S as in V ( G ) − S. An alliance is global if it is also a dominating set of G. The alliance partition number of G was defined in Hedetniemi et al. (2004) to be the maximum number of sets in a partition of V ( G ) such that each set is an alliance. Similarly,...

    Pełny tekst do pobrania w portalu

  • Minimum order of graphs with given coloring parameters

    Publikacja

    - DISCRETE MATHEMATICS - Rok 2015

    A complete k-coloring of a graph G=(V,E) is an assignment F: V -> {1,...,k} of colors to the vertices such that no two vertices of the same color are adjacent, and the union of any two color classes contains at least one edge. Three extensively investigated graph invariants related to complete colorings are the minimum and maximum number of colors in a complete coloring (chromatic number χ(G) and achromatic number ψ(G), respectively),...

    Pełny tekst do pobrania w portalu

  • New Tetragonal ReGa5(M) (M = Sn, Pb, Bi) Single Crystals Grown from Delicate Electrons Changing

    Publikacja

    - Crystals - Rok 2019

    Single crystals of the new Ga-rich phases ReGa~5(Sn), ReGa~5(Pb) and ReGa~5(Bi) were successfully obtained from the flux method. The new tetragonal phases crystallize in the space group P4/mnc (No. 128) with vertex-sharing capped Re2@Ga14 oblong chains. Vacancies were discovered on the Ga4 and Ga5 sites, which can be understood as the direct inclusion of elemental Sn, Pb and Bi into the structure. Heat capacity measurements were...

    Pełny tekst do pobrania w portalu

  • Machine Learning-Based Wetland Vulnerability Assessment in the Sindh Province Ramsar Site Using Remote Sensing Data

    Publikacja
    • R. W. Aslam
    • H. Shu
    • I. Naz
    • A. Quddoos
    • A. Yaseen
    • K. Gulshad
    • S. Saud Alarifi

    - Remote Sensing - Rok 2024

    Wetlands provide vital ecological and socioeconomic services but face escalating pressures worldwide. This study undertakes an integrated spatiotemporal assessment of the multifaceted vulnerabilities shaping Khinjhir Lake, an ecologically significant wetland ecosystem in Pakistan, using advanced geospatial and machine learning techniques. Multi-temporal optical remote sensing data from 2000 to 2020 was analyzed through spectral...

    Pełny tekst do pobrania w portalu

  • Spatial variability of throughfall in a stand of Scots pine (Pinus sylvestris L.) with deciduous admixture as influenced by canopy cover and stem distance

    Publikacja

    - JOURNAL OF HYDROLOGY - Rok 2016

    Vegetation cover affects the amount of precipitation, its chemical composition and its spatial distribution, and this may have implications for the distribution of water, nutrients and contaminants in the subsurface soil layer. The aim of this study was a detailed diagnosis of the spatio-temporal variability in the amount of throughfall (TF) and its chemical components in a 72-year-old pine stand with an admixture of oak and birch....

    Pełny tekst do pobrania w serwisie zewnętrznym

  • The computational complexity of the backbone coloring problem for bounded-degree graphs with connected backbones

    Given a graph G, a spanning subgraph H of G and an integer λ>=2, a λ-backbone coloring of G with backbone H is a vertex coloring of G using colors 1, 2, ..., in which the color difference between vertices adjacent in H is greater than or equal to lambda. The backbone coloring problem is to find such a coloring with maximum color that does not exceed a given limit k. In this paper, we study the backbone coloring problem for bounded-degree...

    Pełny tekst do pobrania w serwisie zewnętrznym

  • Dynamic unattended measurement based routing algorithm for diffServ architecture

    Publikacja

    - Rok 2010

    Dynamic routing is very important in terms of assuring QoS in today's packet networks especially for streaming and elastic services. Existing solutions dedicated to dynamic routing are often too complicated and seem to be not usable in real time traffic scenarios where transferred traffic may vary significantly. This was the main reason for research and new routing mechanism proposal which should apply to today's packet networks....

    Pełny tekst do pobrania w serwisie zewnętrznym

  • Towards a classification of networks with asymmetric inputs

    Publikacja

    - NONLINEARITY - Rok 2021

    Coupled cell systems associated with a coupled cell network are determined by (smooth) vector fields that are consistent with the network structure. Here, we follow the formalisms of Stewart et al (2003 SIAM J. Appl. Dyn. Syst. 2, 609–646), Golubitsky et al (2005 SIAM J. Appl. Dyn. Syst. 4, 78–100) and Field (2004 Dyn. Syst. 19, 217–243). It is known that two non-isomorphic n-cell coupled networks can determine the same sets of...

    Pełny tekst do pobrania w portalu

  • Simulation model for evaluation of QoS routing algorithm in large packet networks

    The variety of traffic transferred via current telecommunication networks includes also voice, which should meet quality requirements. One of mechanisms, which can support QoS in current packet networks, is routing. There exist many routing proposals which should introduce the QoS into the network but practically they don't. Following paper presents the realization of simulation model for evaluation of a new routing algorithm DUMBRA...

  • On-line Ramsey Numbers of Paths and Cycles

    Publikacja

    - ELECTRONIC JOURNAL OF COMBINATORICS - Rok 2015

    Consider a game played on the edge set of the infinite clique by two players, Builder and Painter. In each round, Builder chooses an edge and Painter colours it red or blue. Builder wins by creating either a red copy of $G$ or a blue copy of $H$ for some fixed graphs $G$ and $H$. The minimum number of rounds within which Builder can win, assuming both players play perfectly, is the \emph{on-line Ramsey number} $\tilde{r}(G,H)$. In...

    Pełny tekst do pobrania w portalu

  • Atmospheric degradation mechanism of anthracene initiated by OH•: A DFT prediction

    Publikacja

    - JOURNAL OF MOLECULAR GRAPHICS & MODELLING - Rok 2023

    Density functional theory (DFT) calculations at the M06-2X/def2-TZVP level have been employed to investigate the atmospheric oxidation mechanism of anthracene (ANT) initiated by HO•. Direct hydrogen atom abstraction from the ANT using HO• takes place hardly at ambient conditions while the addition of HO• to the C1, C2, and C4 sites are thermodynamically and kinetically more advantageous. The addition reactions are controlled by...

    Pełny tekst do pobrania w serwisie zewnętrznym

  • THE 3D MODEL OF WATER SUPPLY NETWORK WITH APPLICATION OF THE ELEVATION DATA

    Publikacja

    - Rok 2017

    3D visualization is a key element of research and analysis and as the source used by experts in various fields e.g.: experts from water and sewage systems. The aim of this study was to visualize in three-dimensional space model of water supply network with relief. The path of technological development of GESUT data (Geodezyjna Ewidencja Sieci Uzbrojenia Terenu – geodetic records of public utilities) for water supply and measurement...

    Pełny tekst do pobrania w serwisie zewnętrznym

  • Topology recognition and leader election in colored networks

    Publikacja

    Topology recognition and leader election are fundamental tasks in distributed computing in networks. The first of them requires each node to find a labeled isomorphic copy of the network, while the result of the second one consists in a single node adopting the label 1 (leader), with all other nodes adopting the label 0 and learning a path to the leader. We consider both these problems in networks whose nodes are equipped with...

    Pełny tekst do pobrania w portalu

  • Ranking of ecotoxisity tests for underground water assessment using the Hasse diagram technique

    Publikacja

    - CHEMOSPHERE - Rok 2014

    The present study deals with the novel application of the Hasse diagram technique (HDT) for the specific ranking of ecotoxicity tests capable of assessment of underground water quality. The area studied is a multi-municipal landfill in the northern Poland. The monitoring network of the landfill constitutes of 27 piezometers for underground water monitoring and two observation points at surface water courses. After sampling, chemical...

    Pełny tekst do pobrania w serwisie zewnętrznym