Buscar
Mostrando ítems 1-10 de 147
Recognizing Well Covered Graphs of Families with Special P (4)-Components
(Springer Japan KkTokyoJapão, 2013)
Neighborhood covering and independence on P4-tidy graphs and tree-cographs
(Springer, 2017-11)
Given a simple graph G, a set (Formula presented.) is a neighborhood cover set if every edge and vertex of G belongs to some G[v] with (Formula presented.), where G[v] denotes the subgraph of G induced by the closed ...
Neighborhood covering and independence on P4-tidy graphs and tree-cographs
(Springer, 2020)
Given a simple graph G, a set C subset of V(G)\documentclass[12pt] is a neighborhood cover set if every edge and vertex of G belongs to some G[v] with v is an element of C\documentclass[12pt] denotes the subgraph of G ...
Neighborhood covering and independence on P4-tidy graphs and tree-cographs
(Springer, 2020)
Given a simple graph G, a set C subset of V(G)\documentclass[12pt] is a neighborhood cover set if every edge and vertex of G belongs to some G[v] with v is an element of C\documentclass[12pt] denotes the subgraph of G ...
Ear decompositions of matching covered graphs
(Janos Bolyai Mathematical SocBudapestHungria, 1999)
Numerical evidence against a conjecture on the cover time of planar graphs
(AMER PHYSICAL SOC, 2011)
We investigate a conjecture on the cover times of planar graphs by means of large Monte Carlo simulations. The conjecture states that the cover time tau (G(N)) of a planar graph G(N) of N vertices and maximal degree d is ...
Estudo da complexidade de grafos bem cobertos-(r,l) : reconhecimento, problemas sanduíche e probeA complexity approach of the (r,l)-well-covered graphs: recognition, sandwich problems and probe
(Universidade Federal do Rio de JaneiroBrasilInstituto Alberto Luiz Coimbra de Pós-Graduação e Pesquisa de EngenhariaPrograma de Pós-Graduação em Engenharia de Sistemas e ComputaçãoUFRJ, 2021)
Knowledge graphs and big data processing
Data Analytics involves applying algorithmic processes to derive insights. Nowadays
it is used in many industries to allow organizations and companies to make better
decisions as well as to verify or disprove existing ...
Problema de cobertura por vértices em redes complexas
(Universidade Tecnológica Federal do ParanáCuritibaPrograma de Pós-Graduação em Computação Aplicada, 2013-08-30)
Graph theory is a mathematical tool used in solving many algorithmic and computational problems in that both sets of model elements and relationships between these elements. Most natural and technological systems can be ...