Relevant bibliographies by topics / Weakly proper spanning tree

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Book chapters
  4. Conference papers

Academic literature on the topic 'Weakly proper spanning tree'

Author: Grafiati
Published: 25 May 2024
Last updated: 31 July 2025

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Weakly proper spanning tree.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Weakly proper spanning tree"

1

ALZOUBI, KHALED M., PENG-JUN WAN, and 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, no. 02 (2003): 287–303. http://dx.doi.org/10.1142/s012905410300173x.

Full text
Abstract:
A maximal independent set (MIS) S for a graph G is an independent set and no proper superset of S is also independent. A set S is dominating if each node in the graph is either in S or adjacent to one of the nodes in S. The subgraph weakly induced by S is the graph G′ such that each edge in G′ has at least one end point in S. A set S is a weakly-connected dominating set (WCDS) of G if S is dominating and G′ is connected. G′ is a sparse spanner if it has linear edges. The nodes of WCDS have been proposed in the literature as clusterheads for clustered wireless ad hoc networks. In this paper, we
APA, Harvard, Vancouver, ISO, and other styles
2

Bhatt, Abhay G., and Rahul Roy. "On a random directed spanning tree." Advances in Applied Probability 36, no. 1 (2004): 19–42. http://dx.doi.org/10.1239/aap/1077134462.

Full text
Abstract:
We study the asymptotic properties of a minimal spanning tree formed by n points uniformly distributed in the unit square, where the minimality is amongst all rooted spanning trees with a direction of growth. We show that the number of branches from the root of this tree, the total length of these branches, and the length of the longest branch each converges weakly. This model is related to the study of record values in the theory of extreme-value statistics and this relation is used to obtain our results. The results also hold when the tree is formed from a Poisson point process of intensity
APA, Harvard, Vancouver, ISO, and other styles
3

Bhatt, Abhay G., and Rahul Roy. "On a random directed spanning tree." Advances in Applied Probability 36, no. 01 (2004): 19–42. http://dx.doi.org/10.1017/s0001867800012854.

Full text
Abstract:
We study the asymptotic properties of a minimal spanning tree formed by n points uniformly distributed in the unit square, where the minimality is amongst all rooted spanning trees with a direction of growth. We show that the number of branches from the root of this tree, the total length of these branches, and the length of the longest branch each converges weakly. This model is related to the study of record values in the theory of extreme-value statistics and this relation is used to obtain our results. The results also hold when the tree is formed from a Poisson point process of intensity
APA, Harvard, Vancouver, ISO, and other styles
4

Mayliana, Mayliana. "Optimasi Jaringan dengan Spanning Tree untuk Congestion Management." ComTech: Computer, Mathematics and Engineering Applications 5, no. 1 (2014): 53. http://dx.doi.org/10.21512/comtech.v5i1.2582.

Full text
Abstract:
A proper network optimization is needed to deal with problems on the network and to minimize latency in the data flow in a dense network. The data stream is directed into the right channels so that the optimal network speed and latency can be minimized. Spanning tree is one of the algorithms that can be used. The purpose of the Spanning tree is to prevent and reduce the loops in the network by negotiating free path and as well as to increase network uptime through redundancy (back-up). To comprehend spanning tree, the first important thing to know is how bridges and switches perform their func
APA, Harvard, Vancouver, ISO, and other styles
5

Penrose, Mathew D. "Extremes for the minimal spanning tree on normally distributed points." Advances in Applied Probability 30, no. 3 (1998): 628–39. http://dx.doi.org/10.1239/aap/1035228120.

Full text
Abstract:
Let n points be placed independently in ν-dimensional space according to the standard ν-dimensional normal distribution. Let Mn be the longest edge-length of the minimal spanning tree on these points; equivalently let Mn be the infimum of those r such that the union of balls of radius r/2 centred at the points is connected. We show that the distribution of (2 log n)1/2Mn - bn converges weakly to the Gumbel (double exponential) distribution, where bn are explicit constants with bn ~ (ν - 1)log log n. We also show the same result holds if Mn is the longest edge-length for the nearest neighbour g
APA, Harvard, Vancouver, ISO, and other styles
6

Penrose, Mathew D. "Extremes for the minimal spanning tree on normally distributed points." Advances in Applied Probability 30, no. 03 (1998): 628–39. http://dx.doi.org/10.1017/s000186780000851x.

Full text
Abstract:
Let n points be placed independently in ν-dimensional space according to the standard ν-dimensional normal distribution. Let M n be the longest edge-length of the minimal spanning tree on these points; equivalently let M n be the infimum of those r such that the union of balls of radius r/2 centred at the points is connected. We show that the distribution of (2 log n)1/2 M n - b n converges weakly to the Gumbel (double exponential) distribution, where b n are explicit constants with b n ~ (ν - 1)log log n. We also show the same result holds if M n is the longest edge-length for the nearest nei
APA, Harvard, Vancouver, ISO, and other styles
7

Dereniowski, Dariusz. "Minimum vertex ranking spanning tree problem for chordal and proper interval graphs." Discussiones Mathematicae Graph Theory 29, no. 2 (2009): 253. http://dx.doi.org/10.7151/dmgt.1445.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Bereta, Michał. "Evolutionary Approach to the Euclidean Steiner Tree Problem in n-Space." Applied Sciences 15, no. 3 (2025): 1413. https://doi.org/10.3390/app15031413.

Full text
Abstract:
This article presents the application of a genetic algorithm for solving the Euclidean Steiner problem in spaces of dimensionality greater than 2. The Euclidean Steiner problem involves finding the minimum spanning network that connects a given set of vertices, including the additional Steiner vertices, in a multi-dimensional space. The focus of this research is to compare several different settings of the method, including the crossover operators and sorting of the input data. The paper points out that significant improvement in results can be achieved through proper initialization of the ini
APA, Harvard, Vancouver, ISO, and other styles
9

Sisto, Alessandro. "Contracting elements and random walks." Journal für die reine und angewandte Mathematik (Crelles Journal) 2018, no. 742 (2018): 79–114. http://dx.doi.org/10.1515/crelle-2015-0093.

Full text
Abstract:
Abstract We define a new notion of contracting element of a group and we show that contracting elements coincide with hyperbolic elements in relatively hyperbolic groups, pseudo-Anosovs in mapping class groups, rank one isometries in groups acting properly on proper {\mathrm{CAT}(0)} spaces, elements acting hyperbolically on the Bass–Serre tree in graph manifold groups. We also define a related notion of weakly contracting element, and show that those coincide with hyperbolic elements in groups acting acylindrically on hyperbolic spaces and with iwips in {\mathrm{Out}(F_{n})} , {n\geq 3} . We
APA, Harvard, Vancouver, ISO, and other styles
10

FERRAGINA, PAOLO, and FABRIZIO LUCCIO. "THREE TECHNIQUES FOR PARALLEL MAINTENANCE OF A MINIMUM SPANNING TREE UNDER BATCH OF UPDATES." Parallel Processing Letters 06, no. 02 (1996): 213–22. http://dx.doi.org/10.1142/s0129626496000212.

Full text
Abstract:
In this paper we provide three simple techniques to maintain in parallel the minimum spanning tree of an undirected graph under single or batch of edge updates (i.e., insertions and deletions). Our results extend the use of the sparsification data structure to the EREW PRAM model. For proper values of the batch size, our algorithms require less time and work than the best known dynamic parallel algorithms.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Weakly proper spanning tree"

1

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.

Full text
Abstract:
Un graphe arête-colorié Gc est un graphe dont les arêtes sont coloriées par un ensemble de couleurs données. Un sous-graphe de Gc est dit proprement colorié s'il ne contient pas d'arêtes adjacentes de même couleur. Un graphe ou multigraphe c-arête-colorié Gc, est dit k-lié (respectivement k-arête-lié) si et seulement si quelque soient 2k sommets distincts de V(Gc), notés, x1 y1 , x2 y2 , ..., xk yk , il existe k chaînes élémentaires sommet-disjointes (respectivement arête-disjointes) proprement arête-coloriées, reliant x1 à y1 , x2 à y2 , ... , xk à yk .Un arbre couvrant propre d'un graphe Gc
APA, Harvard, Vancouver, ISO, and other styles
2

Ouyang, 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.

Full text
Abstract:
La coloration de graphes est l'un des sujets les plus connus, populaires et largement étudiés dans le domaine de la théorie des graphes, avec une vaste littérature comprenant des approches provenant de nombreux domaines ainsi que de nombreux problèmes qui sont encore ouverts et étudiés par divers mathématiciens et informaticiens à travers le monde. Le Problème des Quatre Couleurs, à l'origine de l'étude de la coloration des graphes, a été l'un des problèmes centraux en théorie des graphes au siècle dernier. Il demande s'il est possible de colorer proprement chaque graphe planaire avec quatre c
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Weakly proper spanning tree"

1

"A Simple Algorithm to Find the Proper Spanning Tree in Metro Ethernet Networks." In International Conference on Software Technology and Engineering, 3rd (ICSTE 2011). ASME Press, 2011. http://dx.doi.org/10.1115/1.859797.paper27.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Fatih 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.

Full text
Abstract:
Black hole algorithm (BHA) is a popular metaheuristic algorithm proposed and applied for data clustering in 2013. BHA was applied to continuous and discrete problems; it is also hybridized with some algorithms in the literature. The pure BHA shows better performance than others in discrete optimization, such as traveling salesman problems. However, it requires improving the algorithm with competitive heuristics. Many heuristics have often been used to construct the initial tour of a salesman, such as the nearest neighbor algorithm (NN), nearest insertion algorithm (NI), cheapest insertion algo
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Weakly proper spanning tree"

1

Srimani, Pradip K., and 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.

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Weakly proper spanning tree' for particular source types:
Journal articles
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography