Relevant bibliographies by topics / Unweighted graph

Contents

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

Academic literature on the topic 'Unweighted graph'

Author: Grafiati
Published: 3 June 2025
Last updated: 20 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 'Unweighted graph.'

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 "Unweighted graph"

1

Shi, Xiaolong, Saira Hameed, Sadia Akhter, Aysha Khan, and Maryam Akhoundi. "Conversion of Unweighted Graphs to Weighted Graphs Satisfying Properties R and −SR." Axioms 12, no. 11 (2023): 1043. http://dx.doi.org/10.3390/axioms12111043.

Full text
Abstract:
Spectral graph theory is like a special tool for understanding graphs. It helps us find patterns and connections in complex networks, using the magic of eigenvalues. Let G be the graph and A(G) be its adjacency matrix, then G is singular if the determinant of the adjacency matrix A(G) is 0, otherwise it is nonsingular. Within the realm of nonsingular graphs, there is the concept of property R, where each eigenvalue’s reciprocal is also an eigenvalue of G. By introducing multiplicity constraints on both eigenvalues and their reciprocals, it becomes property SR. Similarly, the world of nonsingul
APA, Harvard, Vancouver, ISO, and other styles
2

Panda, Swarup, and Dr Sukanta Pati. "On The Inverse Of A Class Of Bipartite Graphs With Unique Perfect Matchings." Electronic Journal of Linear Algebra 29 (September 20, 2015): 89–101. http://dx.doi.org/10.13001/1081-3810.2865.

Full text
Abstract:
Let G be a simple, undirected graph and Gw be the weighted graph obtained from G by giving weights to its edges using a positive weight function w. A weighted graph Gw is said to be nonsingular if its adjacency matrix A(Gw) is nonsingular. In [9], Godsil has given a class $\mathcal{G }$of connected, unweighted, bipartite, nonsingular graphs G with a unique perfect matching, such that A(G)−1 is signature similar to a nonnegative matrix, that is, there exists a diagonal matrix D with diagonal entries ±1 such that DA(G)−1D is nonnegative. The graph associated to the matrix DA(G)−1D is call
APA, Harvard, Vancouver, ISO, and other styles
3

Carlson, W., A. Ford, E. Harris, J. Rosen, C. Tamon, and K. Wrobel. "Universal Mixing of Quantum Walk on Graphs." Quantum Information and Computation 7, no. 8 (2007): 738–51. http://dx.doi.org/10.26421/qic7.8-4.

Full text
Abstract:
We study the set of probability distributions visited by a continuous-time quantum walk on graphs. An edge-weighted graph $G$ is {\em universal mixing} if the instantaneous or average probability distribution of the quantum walk on $G$ ranges over all probability distributions on the vertices as the weights are varied over non-negative reals. The graph is {\em uniform} mixing if it visits the uniform distribution. Our results include the following: 1) All weighted complete multipartite graphs are instantaneous universal mixing. This is in contrast to the fact that no {\em unweighted} complete
APA, Harvard, Vancouver, ISO, and other styles
4

Trigo, Macarena. "On Harary energy and Reciprocal distance Laplacian energies1." Journal of Physics: Conference Series 2090, no. 1 (2021): 012102. http://dx.doi.org/10.1088/1742-6596/2090/1/012102.

Full text
Abstract:
Abstract Let G be an graph simple, undirected, connected and unweighted graphs. The Reciprocal distance energy of a graph G is equal to the sum of the absolute values of the reciprocal distance eigenvalues. In this work, we find a lower bound for the Harary energy, reciprocal distance Laplacian energy and reciprocal distance signless Laplacian energy of a graph. Moreover, we find relationship between the Harary energy and Reciprocal distance Laplacian energies.
APA, Harvard, Vancouver, ISO, and other styles
5

Braga, R. O., V. M. Rodrigues, and R. O. Silva. "Locating Eigenvalues of a Symmetric Matrix whose Graph is Unicyclic." Trends in Computational and Applied Mathematics 22, no. 4 (2021): 659–74. http://dx.doi.org/10.5540/tcam.2021.022.04.00659.

Full text
Abstract:
We present a linear-time algorithm that computes in a given real interval the number of eigenvalues of any symmetric matrix whose underlying graph is unicyclic. The algorithm can be applied to vertex- and/or edge-weighted or unweighted unicyclic graphs. We apply the algorithm to obtain some general results on the spectrum of a generalized sun graph for certain matrix representations which include the Laplacian, normalized Laplacian and signless Laplacian matrices.
APA, Harvard, Vancouver, ISO, and other styles
6

MIZUTA, Haruka, Takehiro ITO, and Xiao ZHOU. "Reconfiguration of Steiner Trees in an Unweighted Graph." IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences E100.A, no. 7 (2017): 1532–40. http://dx.doi.org/10.1587/transfun.e100.a.1532.

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

Demange, Marc, and Vangelis Paschos. "Improved Approximations for Weighted and Unweighted Graph Problems." Theory of Computing Systems 38, no. 6 (2004): 763–87. http://dx.doi.org/10.1007/s00224-004-1162-6.

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

Spricer, Kristoffer, and Tom Britton. "An SIR epidemic on a weighted network." Network Science 7, no. 4 (2019): 556–80. http://dx.doi.org/10.1017/nws.2019.54.

Full text
Abstract:
AbstractWe introduce a weighted configuration model graph, where edge weights correspond to the probability of infection in an epidemic on the graph. On these graphs, we study the development of a Susceptible–Infectious–Recovered epidemic using both Reed–Frost and Markovian settings. For the special case of having two different edge types, we determine the basic reproduction numberR0, the probability of a major outbreak, and the relative final size of a major outbreak. Results are compared with those for a calibrated unweighted graph. The degree distributions are based on both theoretical cons
APA, Harvard, Vancouver, ISO, and other styles
9

SUN, YACHYANG, and KOK-HOO YEAP. "EDGE COVERING OF COMPLEX TRIANGLES IN RECTANGULAR DUAL FLOORPLANNING." Journal of Circuits, Systems and Computers 03, no. 03 (1993): 721–31. http://dx.doi.org/10.1142/s0218126693000435.

Full text
Abstract:
Rectangular dual graph approach to floorplanning is based on the adjacency graph of the modules in a floorplan. If the input adjacency graph contains a cycle of length three which is not a face (complex triangle), a rectangular floorplan does not exist. Thus, complex triangles have to be eliminated before applying any floorplanning algorithm. This paper shows that the weighted complex triangle elimination problem is NP-complete, even when the input graphs are restricted to 1-level containment. For adjacency graph with 0-level containment, the unweighted problem is optimally solvable in O(c1.5
APA, Harvard, Vancouver, ISO, and other styles
10

Burkett, David, David Hall, and Dan Klein. "Optimal Graph Search with Iterated Graph Cuts." Proceedings of the AAAI Conference on Artificial Intelligence 25, no. 1 (2011): 12–17. http://dx.doi.org/10.1609/aaai.v25i1.7829.

Full text
Abstract:
Informed search algorithms such as A* use heuristics to focus exploration on states with low total path cost. To the extent that heuristics underestimate forward costs, a wider cost radius of suboptimal states will be explored. For many weighted graphs, however, a small distance in terms of cost may encompass a large fraction of the unweighted graph. We present a new informed search algorithm, Iterative Monotonically Bounded A* (IMBA*), which first proves that no optimal paths exist in a bounded cut of the graph before considering larger cuts. We prove that IMBA* has the same optimality and co
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Unweighted graph"

1

Al-Baghdadi, Ahmed. "COMPUTING TOP-K CLOSENESS CENTRALITY IN UNWEIGHTED UNDIRECTED GRAPHS REVISITED." Kent State University / OhioLINK, 2017. http://rave.ohiolink.edu/etdc/view?acc_num=kent1492421540217573.

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

Badoiu, Mihai, Piotr Indyk, and Anastasios Sidiropoulos. "A Constant-Factor Approximation Algorithm for Embedding Unweighted Graphs into Trees." 2004. http://hdl.handle.net/1721.1/30484.

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

Book chapters on the topic "Unweighted graph"

1

Mizuta, Haruka, Takehiro Ito, and Xiao Zhou. "Reconfiguration of Steiner Trees in an Unweighted Graph." In Lecture Notes in Computer Science. Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-44543-4_13.

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

Ben-Ameur, Walid, Antoine Glorieux, and José Neto. "From Graph Orientation to the Unweighted Maximum Cut." In Lecture Notes in Computer Science. Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-42634-1_30.

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

Blažej, Václav, Pratibha Choudhary, Dušan Knop, Jan Matyáš Křišt’an, Ondřej Suchý, and Tomáš Valla. "Constant Factor Approximation for Tracking Paths and Fault Tolerant Feedback Vertex Set." In Approximation and Online Algorithms. Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-92702-8_2.

Full text
Abstract:
AbstractConsider a vertex-weighted graph G with a source s and a target t. Tracking Paths requires finding a minimum weight set of vertices (trackers) such that the sequence of trackers in each path from s to t is unique. In this work, we derive a factor 66-approximation algorithm for Tracking Paths in weighted graphs and a factor 4-approximation algorithm if the input is unweighted. This is the first constant factor approximation for this problem. While doing so, we also study approximation of the closely related r-Fault Tolerant Feedback Vertex Set problem. There, for a fixed integer r and a given vertex-weighted graph G, the task is to find a minimum weight set of vertices intersecting every cycle of G in at least $$r+1$$ r + 1 vertices. We give a factor $$\mathcal {O}(r^2)$$ O ( r 2 ) approximation algorithm for r-Fault Tolerant Feedback Vertex Set if r is a constant.
APA, Harvard, Vancouver, ISO, and other styles
4

Bai, Xingjian, Christian Coester, and Romain Cosson. "Unweighted Layered Graph Traversal: Passing a Crown via Entropy Maximization." In Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). Society for Industrial and Applied Mathematics, 2025. https://doi.org/10.1137/1.9781611978322.131.

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

Gawrychowski, Paweł, and Przemysław Uznański. "Better Distance Labeling for Unweighted Planar Graphs." In Lecture Notes in Computer Science. Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-83508-8_31.

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

Fidel, Adam, Francisco Coral Sabido, Colton Riedel, Nancy M. Amato, and Lawrence Rauchwerger. "Fast Approximate Distance Queries in Unweighted Graphs Using Bounded Asynchrony." In Languages and Compilers for Parallel Computing. Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-52709-3_4.

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

Călinescu, Gruia, Cristina G. Fernandes, and Bruce Reed. "Multicuts in Unweighted Graphs with Bounded Degree and Bounded Tree-Width." In Integer Programming and Combinatorial Optimization. Springer Berlin Heidelberg, 1998. http://dx.doi.org/10.1007/3-540-69346-7_11.

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

Roditty, Liam, and Uri Zwick. "Replacement Paths and k Simple Shortest Paths in Unweighted Directed Graphs." In Automata, Languages and Programming. Springer Berlin Heidelberg, 2005. http://dx.doi.org/10.1007/11523468_21.

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

Balzotti, Lorenzo, and Paolo G. Franciosa. "Non-crossing Shortest Paths in Undirected Unweighted Planar Graphs in Linear Time." In Computer Science – Theory and Applications. Springer International Publishing, 2022. http://dx.doi.org/10.1007/978-3-031-09574-0_6.

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

Dragan, Feodor F., and Ekkehard Köhler. "An Approximation Algorithm for the Tree t-Spanner Problem on Unweighted Graphs via Generalized Chordal Graphs." In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques. Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-22935-0_15.

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

Conference papers on the topic "Unweighted graph"

1

Zhou, Wen, Taihua Xu, Lisi Dai, Jianjun Chen, and Jingjing Song. "Multi-Source Shortest Paths Mining Algorithm for Unweighted Directed Graphs Based on Rough Sets Theory." In 2024 5th International Conference on Computers and Artificial Intelligence Technology (CAIT). IEEE, 2024. https://doi.org/10.1109/cait64506.2024.10963148.

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

Masquio, Bruno, Paulo Pinto, and Jayme Szwarcfiter. "Algoritmos eficientes para emparelhamentos desconexos em grafos cordais e grafos bloco." In IV Encontro de Teoria da Computação. Sociedade Brasileira de Computação - SBC, 2019. http://dx.doi.org/10.5753/etc.2019.6390.

Full text
Abstract:
Graph matching problems are well studied and bring great contributions to Graph Theory from both the theoretical and practical points of view. There are numerous studies for unrestricted and weighted/unweighted matchings. More recently, subgraph-restricted matchings have been proposed, which consider properties of the subgraph induced by the vertices of the matching. In this paper, we approach one of these new proposals, disconnected matching, which seeks to study maximum matching, such that the subgraph induced by the matching vertices is disconnected. We have described efficient algorithms t
APA, Harvard, Vancouver, ISO, and other styles
3

Wu, Chencheng, Yinzuo Zhou, Lulu Tan, and Cong Teng. "Link Prediction Based on Graph Embedding Method in Unweighted Networks." In 2020 39th Chinese Control Conference (CCC). IEEE, 2020. http://dx.doi.org/10.23919/ccc50068.2020.9188785.

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

Nakao, Masahiro, Hitoshi Murai, and Mitsuhisa Sato. "Parallelization of All-Pairs-Shortest-Path Algorithms in Unweighted Graph." In HPCAsia2020: International Conference on High Performance Computing in Asia-Pacific Region. ACM, 2020. http://dx.doi.org/10.1145/3368474.3368478.

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

Lv Xu-guang and Zhu Da-ming. "An approximation algorithm for the shortest cycle in an undirected unweighted graph." In 2010 International Conference on Computer, Mechatronics, Control and Electronic Engineering (CMCE 2010). IEEE, 2010. http://dx.doi.org/10.1109/cmce.2010.5610495.

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

Kawano, Ryuta, Hiroki Matsutani, Michihiro Koibuchi, and Hideharu Amano. "GPU Parallelization of All-Pairs-Shortest-Path Algorithm in Low-Degree Unweighted Regular Graph." In ACIT 2021: The 8th International Virtual Conference on Applied Computing & Information Technology. ACM, 2021. http://dx.doi.org/10.1145/3468081.3471122.

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

Pedrosa, Lehilton Lelis Chaves, and Lucas de Oliveira Silva. "Freeze-Tag Remains NP-hard on Binary and Ternary Trees." In Encontro de Teoria da Computação. Sociedade Brasileira de Computação - SBC, 2023. http://dx.doi.org/10.5753/etc.2023.229327.

Full text
Abstract:
The Freeze-Tag Problem (FTP) is a scheduling-like problem motivated by robot swarm activation. The input consists of the locations of a set of mobile robots in some metric space. One robot is initially active, while the others are initially frozen. Active robots can move at unit speed, and upon reaching the location of a frozen robot, the latter is activated. The goal is to activate all the robots within the minimum time, i.e., minimizing the time the last frozen robot is activated, the so-called makespan of the schedule. Arkin et al. proved that FTP is strongly NP-hard even if we restrict the
APA, Harvard, Vancouver, ISO, and other styles
8

Bhalgat, Anand, and Ramesh Hariharan. "Fast Edge Orientation for Unweighted Graphs." In Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms. Society for Industrial and Applied Mathematics, 2009. http://dx.doi.org/10.1137/1.9781611973068.30.

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

Cucuringu, Mihai, and Joseph Woodworth. "Ordinal embedding of unweighted kNN graphs via synchronization." In 2015 IEEE 25th International Workshop on Machine Learning for Signal Processing (MLSP). IEEE, 2015. http://dx.doi.org/10.1109/mlsp.2015.7324338.

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

Bergamini, Elisabetta, Michele Borassi, Pierluigi Crescenzi, Andrea Marino, and Henning Meyerhenke. "Computing Top-k Closeness Centrality Faster in Unweighted Graphs." In 2016 Proceedings of the Eighteenth Workshop on Algorithm Engineering and Experiments (ALENEX). Society for Industrial and Applied Mathematics, 2015. http://dx.doi.org/10.1137/1.9781611974317.6.

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Unweighted graph' 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