Product
Help
Pricing
About
Jobs
Log in
Get started
Keyword
Add to collection
spanning trees
Description:
Subgraphs of a connected graph that include every vertex and form a tree, studied in graph theory and combinatorics.
Related topics:
Complexity and Algorithms in Graphs (19%),
Graph theory and applications (12%),
Advanced Graph Theory Research (10%)
Wikidata ID:
wiki/Q831672
OpenAlex ID:
keywords/spanning-trees
Consensus seeking in multiagent systems under dynamically changing interaction topologies
2005
·
Wei Ren
, R.W. Beard
·
IEEE Transactions on Automatic Control
·
6,624
Combinatorial Optimization: Algorithms and Complexity.
1984
·
David S. Johnson
, Christos H. Papadimitriou
, et al.
·
American Mathematical Monthly
·
5,960
Robust discrete optimization and network flows
2003
·
Dimitris Bertsimas
, Melvyn Sim
·
Mathematical Programming
·
1,856
Optimal control: Linear quadratic methods
1992
·
Vladimír Kučera
·
Automatica
·
1,538
A fast algorithm for Steiner trees
1981
·
L. Kou
, G. Markowsky
, et al.
·
Acta Informatica
·
1,194
Second-Order Consensus for Multiagent Systems With Directed Topologies and Nonlinear Dynamics
2009
·
Wenwu Yu
, Guanrong Chen
, et al.
·
IEEE Transactions on Systems Man and Cybernetics Part B (Cybernetics)
·
1,114
PDF
Handbook of Computational Geometry
2000
·
Elsevier eBooks
·
1,057
A Contribution to the Theory of Chromatic Polynomials
1954
·
W. T. Tutte
·
Canadian Journal of Mathematics
·
979
PDF
Multi-Terminal Network Flows
1961
·
R. E. Gomory
, T. C. Hu
·
Journal of the Society for Industrial and Applied Mathematics
·
973
Optimal Design for Synchronization of Cooperative Systems: State Feedback, Observer and Output Feedback
2011
·
Hongwei Zhang
, F. L. Lewis
, et al.
·
IEEE Transactions on Automatic Control
·
952
Limiting the spread of misinformation in social networks
2011
·
Ceren Budak
, Divyakant Agrawal
, et al.
·
International World Wide Web Conference (WWW)
·
850
Edge-Disjoint Spanning Trees of Finite Graphs
1961
·
C. St.J. A. Nash-Williams
·
Journal of the London Mathematical Society
·
839
Algorithmic graph theory
1985
·
Alan Gibbons
·
829
Power system observability with minimal phasor measurement placement
1993
·
T.L. Baldwin
, L. Mili
, et al.
·
IEEE Transactions on Power Systems
·
818
Reverse search for enumeration
1996
·
David Avis
, Komei Fukuda
·
Discrete Applied Mathematics
·
778
Prescribed-Time Consensus and Containment Control of Networked Multiagent Systems
2018
·
Yujuan Wang
, Yongduan Song
, et al.
·
IEEE Transactions on Cybernetics
·
770
Optimum broadcasting and personalized communication in hypercubes
1989
·
S.L. Johnsson
, C.-T. Ho
·
IEEE Transactions on Computers
·
751
Asynchronous Consensus in Continuous-Time Multi-Agent Systems With Switching Topology and Time-Varying Delays
2008
·
Feng Xiao
, Long Wang
·
IEEE Transactions on Automatic Control
·
737
PDF
Network approaches to two-dimensional phase unwrapping: intractability and two new algorithms
2000
·
Curtis W. Chen
, Howard A. Zebker
·
Journal of the Optical Society of America A
·
605
Search for a minimal-loss operating spanning tree configuration in an urban power distribution system.
1975
·
Aude Merlin
, Hanna Bäck
·
598
Matroid Theory
2011
·
James Oxley
·
Oxford University Press eBooks
·
586
Phasor Measurement Unit Placement Techniques for Complete and Incomplete Observability
2005
·
R.F. Nuqui
, A.G. Phadke
·
IEEE Transactions on Power Delivery
·
578
Consensus of second-order discrete-time multi-agent systems with nonuniform time-delays and dynamically changing topologies
2009
·
Peng Lin
, Yingmin Jia
·
Automatica
·
537
Min–max and min–max regret versions of combinatorial optimization problems: A survey
2008
·
Hassene Aissi
, Cristina Bazgan
, et al.
·
European Journal of Operational Research
·
498
A tree-based algorithm for distributed mutual exclusion
1989
·
Kerry Raymond
·
ACM Transactions on Computer Systems
·
441
PDF
Show more works
View as search
Works count:
7,611
Citation count:
127,800
Year
Topic
Type