Literatura científica selecionada sobre o tema "Weakly proper spanning tree"
Crie uma referência precisa em APA, MLA, Chicago, Harvard, e outros estilos
Consulte a lista de atuais artigos, livros, teses, anais de congressos e outras fontes científicas relevantes para o tema "Weakly proper spanning tree".
Ao lado de cada fonte na lista de referências, há um botão "Adicionar à bibliografia". Clique e geraremos automaticamente a citação bibliográfica do trabalho escolhido no estilo de citação de que você precisa: APA, MLA, Harvard, Chicago, Vancouver, etc.
Você também pode baixar o texto completo da publicação científica em formato .pdf e ler o resumo do trabalho online se estiver presente nos metadados.
Artigos de revistas sobre o assunto "Weakly proper spanning tree"
ALZOUBI, KHALED M., PENG-JUN WAN e OPHIR FRIEDER. "MAXIMAL INDEPENDENT SET, WEAKLY-CONNECTED DOMINATING SET, AND INDUCED SPANNERS IN WIRELESS AD HOC NETWORKS". International Journal of Foundations of Computer Science 14, n.º 02 (abril de 2003): 287–303. http://dx.doi.org/10.1142/s012905410300173x.
Texto completo da fonteBhatt, Abhay G., e Rahul Roy. "On a random directed spanning tree". Advances in Applied Probability 36, n.º 1 (março de 2004): 19–42. http://dx.doi.org/10.1239/aap/1077134462.
Texto completo da fonteBhatt, Abhay G., e Rahul Roy. "On a random directed spanning tree". Advances in Applied Probability 36, n.º 01 (março de 2004): 19–42. http://dx.doi.org/10.1017/s0001867800012854.
Texto completo da fonteMayliana, Mayliana. "Optimasi Jaringan dengan Spanning Tree untuk Congestion Management". ComTech: Computer, Mathematics and Engineering Applications 5, n.º 1 (30 de junho de 2014): 53. http://dx.doi.org/10.21512/comtech.v5i1.2582.
Texto completo da fontePenrose, Mathew D. "Extremes for the minimal spanning tree on normally distributed points". Advances in Applied Probability 30, n.º 3 (setembro de 1998): 628–39. http://dx.doi.org/10.1239/aap/1035228120.
Texto completo da fontePenrose, Mathew D. "Extremes for the minimal spanning tree on normally distributed points". Advances in Applied Probability 30, n.º 03 (setembro de 1998): 628–39. http://dx.doi.org/10.1017/s000186780000851x.
Texto completo da fonteDereniowski, Dariusz. "Minimum vertex ranking spanning tree problem for chordal and proper interval graphs". Discussiones Mathematicae Graph Theory 29, n.º 2 (2009): 253. http://dx.doi.org/10.7151/dmgt.1445.
Texto completo da fonteHonma, Hirotoshi, Yoko Nakajima, Shino Nagasaki e Atsushi Sasaki. "An Optimal Parallel Algorithm for Constructing a Spanning Tree on Proper Circle Trapezoid Graphs". Journal of Applied Mathematics and Physics 06, n.º 08 (2018): 1649–58. http://dx.doi.org/10.4236/jamp.2018.68141.
Texto completo da fonteFERRAGINA, PAOLO, e FABRIZIO LUCCIO. "THREE TECHNIQUES FOR PARALLEL MAINTENANCE OF A MINIMUM SPANNING TREE UNDER BATCH OF UPDATES". Parallel Processing Letters 06, n.º 02 (junho de 1996): 213–22. http://dx.doi.org/10.1142/s0129626496000212.
Texto completo da fonteSisto, Alessandro. "Contracting elements and random walks". Journal für die reine und angewandte Mathematik (Crelles Journal) 2018, n.º 742 (1 de setembro de 2018): 79–114. http://dx.doi.org/10.1515/crelle-2015-0093.
Texto completo da fonteTeses / dissertações sobre o assunto "Weakly proper spanning tree"
Mendy, Gervais. "Chaînes alternées dans les graphes arête-coloriés : k-linkage et arbres couvrants". Phd thesis, Université Paris Sud - Paris XI, 2011. http://tel.archives-ouvertes.fr/tel-00769929.
Texto completo da fonteOuyang, Qiancheng. "Some colouring problems in edge/vertex-coloured graphs : Structural and extremal studies". Electronic Thesis or Diss., université Paris-Saclay, 2023. http://www.theses.fr/2023UPASG060.
Texto completo da fonteGraph colouring is one of the best known, popular and extensively researched subject in the field of graph theory, having a wide literature with approaches from many domains and a lot of problems, which are still open and studied by various mathematicians and computer scientists along the world. The Four Colour Problem, originating the study of graph colouring, was one of the central problem in graph theory in the last century, which asks if it is possible to colour every planar graph properly by four colours. Despite the theoretical origin, the graph colouring has found many applications in practice like scheduling, frequency assignment problems, segmentation, etc. The Four Colour Problem is a significant one among many problems in chromatic graph theory, from which many variants and generalizations have been proposed. Firstly, in this thesis, we aim to optimize the strategy to colour the vertex of graphs and hypergraphs with some given constraints, which combines the concept of proper colouring and representative element of some vertex subsets. On the other hand, according to the subject to be coloured, a large amount of research and problems of edge-coloured graphs have emerged, which have important applications to biology and web technologies. We provide some analogous results for some connectivity issues—to describe graphs whose edges are assigned enough colours, that guarantee spanning trees or cycles of a specific chromatic structure
Capítulos de livros sobre o assunto "Weakly proper spanning tree"
"A Simple Algorithm to Find the Proper Spanning Tree in Metro Ethernet Networks". In International Conference on Software Technology and Engineering, 3rd (ICSTE 2011), 185–89. ASME Press, 2011. http://dx.doi.org/10.1115/1.859797.paper27.
Texto completo da fonteFatih Demiral, Mehmet. "Perspective Chapter: Experimental Analysis of Black Hole Algorithm with Heuristic Algorithms in Traveling Salesman Problem". In Response Surface Methods - Theory, Applications and Optimization Techniques [Working Title]. IntechOpen, 2024. http://dx.doi.org/10.5772/intechopen.1004380.
Texto completo da fonteTrabalhos de conferências sobre o assunto "Weakly proper spanning tree"
Srimani, Pradip K., e Zhenyu Xu. "Self-Stabilizing Algorithms of Constructing Spanning Tree and Weakly Connected Minimal Dominating Set". In 27th International Conference on Distributed Computing Systems Workshops (ICDCSW'07). IEEE, 2007. http://dx.doi.org/10.1109/icdcsw.2007.73.
Texto completo da fonte