Showing 1 - 13 results of 13 for search 'SPANNING trees' Narrow Search
Search Tools: Email this Search — Save search to account
1
Academic Journal
A simple linear time algorithm for the locally connected spanning tree problem on maximal planar chordal graphs

Authors: Tiziana Calamoneri, Matteo Dell’Orefice, Angelo Monti

Contributors: Calamoneri, Tiziana, Dell'Orefice, Matteo, Monti, Angelo

Subject Terms: locally connected spanning tree, partial k tree, SC k-tree, 2-tree, chordal graph, planar graphs

Relation: info:eu-repo/semantics/altIdentifier/wos/WOS:000463124000002; volume:764; firstpage:2; lastpage:14; numberofpages:13; journal:THEORETICAL COMPUTER SCIENCE; http://hdl.handle.net/11573/1196846; info:eu-repo/semantics/altIdentifier/scopus/2-s2.0-85042925912

Availability: https://doi.org/10.1016/j.tcs.2018.02.025
http://hdl.handle.net/11573/1196846

Zugang prüfen (DOI)

Save to List
2
Academic Journal
Two-phase strategies for the bi-objective minimum spanning tree problem

Authors: Amorosi L., Puerto J.

Contributors: Amorosi, L., Puerto, J.

Subject Terms: combinatorial optimisation, minimum spanning tree, multiple objective programming, two-phase methods

Relation: info:eu-repo/semantics/altIdentifier/wos/WOS:000752656500001; volume:29; firstpage:3435; lastpage:3463; numberofpages:29; journal:INTERNATIONAL TRANSACTIONS IN OPERATIONAL RESEARCH; https://hdl.handle.net/11573/1624185; info:eu-repo/semantics/altIdentifier/scopus/2-s2.0-85124533933

Availability: https://doi.org/10.1111/itor.13120
https://hdl.handle.net/11573/1624185

Zugang prüfen (DOI)

Save to List
3
Conference
Dynamical correlations in financial systems

Authors: Pozzi, F., Aste, T., Rotundo, G., Di Matteo, T.

Contributors: Pozzi, F., Aste, T., Rotundo, G., Di Matteo, T.

Subject Terms: Complex system, Econophysic, Financial data correlation, Minimum spanning tree, Network, Planar maximally filtered graph, Electronic, Optical and Magnetic Material, Condensed Matter Physic, Computer Science Applications1707 Computer Vision and Pattern Recognition, Applied Mathematic, Electrical and Electronic Engineering

File Description: ELETTRONICO

Relation: info:eu-repo/semantics/altIdentifier/isbn/9780819469731; info:eu-repo/semantics/altIdentifier/wos/WOS:000253877000033; ispartofbook:PROCEEDINGS OF SPIE, THE INTERNATIONAL SOCIETY FOR OPTICAL ENGINEERING; Complex Systems II; volume:6802; firstpage:68021E; numberofpages:11; serie:PROCEEDINGS OF SPIE, THE INTERNATIONAL SOCIETY FOR OPTICAL ENGINEERING; http://hdl.handle.net/11573/1114493; info:eu-repo/semantics/altIdentifier/scopus/2-s2.0-41149116093

Availability: https://doi.org/10.1117/12.758822
http://hdl.handle.net/11573/1114493

Zugang prüfen (DOI)

Save to List
4
Academic Journal
A Low Arithmetic-Degree Algorithm for Computing Proximity Graphs

Authors: Fabrizio d'Amore, Paolo Giulio Franciosa

Contributors: D'Amore, Fabrizio, Franciosa, Paolo Giulio

Subject Terms: robust computation, geometric graph, euclidean minimum spanning tree, arithmetic degree

Relation: volume:28; issue:3; firstpage:227; lastpage:253; numberofpages:27; journal:INTERNATIONAL JOURNAL OF COMPUTATIONAL GEOMETRY & APPLICATIONS; http://hdl.handle.net/11573/1197997; info:eu-repo/semantics/altIdentifier/scopus/2-s2.0-85056774134

Availability: https://doi.org/10.1142/S021819591850005X
http://hdl.handle.net/11573/1197997

Zugang prüfen (DOI)

Save to List
5
Academic Journal
Smaller Extended Formulations for the Spanning Tree Polytope of Bounded-Genus Graphs

Authors: Fiorini S., Huynh T., Joret G., Pashkovich K.

Contributors: Fiorini, S., Huynh, T., Joret, G., Pashkovich, K.

Subject Terms: Extended formulation, Genu, Spanning tree polytope

Relation: volume:57; issue:3; firstpage:757; lastpage:761; numberofpages:5; journal:DISCRETE & COMPUTATIONAL GEOMETRY; https://hdl.handle.net/11573/1707612; info:eu-repo/semantics/altIdentifier/scopus/2-s2.0-85009250116

Availability: https://doi.org/10.1007/s00454-016-9852-9
https://hdl.handle.net/11573/1707612

Zugang prüfen (DOI)

Save to List
6
Conference
Algorithms on evolving graphs

Authors: ANAGNOSTOPOULOS, ARISTIDIS, Ravi Kumar, Mohammad Mahdian, Eli Upfal, Fabio Vandin

Contributors: Anagnostopoulos, Aristidi, Ravi, Kumar, Mohammad, Mahdian, Eli, Upfal, Fabio, Vandin

Subject Terms: algorithm, evolving graph, minimum spanning tree, path connectivity

Relation: info:eu-repo/semantics/altIdentifier/isbn/9781450311151; ispartofbook:Proc. 3rd International conference on Innovations in Theoretical Computer Science (ITCS 2012); 3rd Conference on Innovations in Theoretical Computer Science, ITCS 2012; firstpage:149; lastpage:160; numberofpages:12; http://hdl.handle.net/11573/445630; info:eu-repo/semantics/altIdentifier/scopus/2-s2.0-84863416398; http://dl.acm.org/citation.cfm?id=2090249

Availability: https://doi.org/10.1145/2090236.2090249
http://hdl.handle.net/11573/445630
http://dl.acm.org/citation.cfm?id=2090249

Zugang prüfen (DOI)

Save to List
7
Academic Journal
Gallavotti-Cohen-Type Symmetry Related to Cycle Decompositions for Markov Chains and Biochemical Applications

Authors: FAGGIONATO, ALESSANDRA, D. Di Pietro

Contributors: Faggionato, Alessandra, D., Di Pietro

Subject Terms: oriented cycle, generating function, thermodynamic force, spanning tree, nonequilibrium steady state, large deviation, molecular motor, affinity, fluctuation theorem

File Description: STAMPA

Relation: info:eu-repo/semantics/altIdentifier/wos/WOS:000289485700002; volume:143; issue:1; firstpage:11; lastpage:32; numberofpages:22; journal:JOURNAL OF STATISTICAL PHYSICS; http://hdl.handle.net/11573/379608; info:eu-repo/semantics/altIdentifier/scopus/2-s2.0-79954612440; http://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=PARTNER_APP&SrcAuth=LinksAMR&KeyUT=000289485700002&DestLinkType=FullRecord&DestApp=ALL_WOS&UsrCustomerID=0c7ff228ccbaaa74236f48834a34396a; http://www.scopus.com/inward/record.url?eid=2-s2.0-79954612440&partnerID=65&md5=054f293b7eb4d2d4b70efb9e45441ffe

Availability: https://doi.org/10.1007/s10955-011-0161-7
http://hdl.handle.net/11573/379608
http://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=PARTNER_APP&SrcAuth=LinksAMR&KeyUT=000289485700002&DestLinkType=FullRecord&DestApp=ALL_WOS&UsrCustomerID=0c7ff228ccbaaa74236f48834a34396a
http://www.scopus.com/inward/record.url?eid=2-s2.0-79954612440&partnerID=65&md5=054f293b7eb4d2d4b70efb9e45441ffe

Zugang prüfen (DOI)

Save to List
10
Conference
A Robust Region Approach to the Computation of Geometric Graphs

Authors: D'AMORE, Fabrizio, FRANCIOSA, Paolo Giulio, G. Liotta

Contributors: D'Amore, Fabrizio, Franciosa, Paolo Giulio, G., Liotta

Subject Terms: algorithm, minimum spanning tree, nearest neighbor graph, relative neighborhood graph

File Description: STAMPA

Relation: info:eu-repo/semantics/altIdentifier/isbn/978-3-540-68530-2; ispartofbook:European Symposium on Algorithms; Algorithms - {ESA} '98, 6th Annual European Symposium; volume:1461; firstpage:320; lastpage:333; numberofpages:14; serie:LECTURE NOTES IN COMPUTER SCIENCE; http://hdl.handle.net/11573/242597

Availability: https://doi.org/10.1007/3-540-68530-8_15
http://hdl.handle.net/11573/242597

Zugang prüfen (DOI)

Save to List
12
Academic Journal
On the bounded-hop MST problem on random Euclidean instances

Authors: Andrea E. F. Clementi, Miriam Di Ianni, Gianluca Rossi, LAURIA, MASSIMO, MONTI, Angelo, SILVESTRI, RICCARDO

Contributors: Andrea E. F., Clementi, Miriam Di, Ianni, Lauria, Massimo, Monti, Angelo, Gianluca, Rossi, Silvestri, Riccardo

Subject Terms: approximation algorithm, bounded height minimum spanning tree, randomized algorithms

File Description: STAMPA

Relation: info:eu-repo/semantics/altIdentifier/wos/WOS:000250387800004; 12th International Colloquium on Structural Information and Communication Complexity; volume:384; issue:2-3; firstpage:161; lastpage:167; numberofpages:7; journal:THEORETICAL COMPUTER SCIENCE; http://hdl.handle.net/11573/362188; info:eu-repo/semantics/altIdentifier/scopus/2-s2.0-34548509229; http://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=PARTNER_APP&SrcAuth=LinksAMR&KeyUT=000250387800004&DestLinkType=FullRecord&DestApp=ALL_WOS&UsrCustomerID=0c7ff228ccbaaa74236f48834a34396a; http://www.scopus.com/inward/record.url?eid=2-s2.0-34548509229&partnerID=65&md5=f5d951eec48907c60a5407ca086bd765

Availability: https://doi.org/10.1016/j.tcs.2007.04.039
http://hdl.handle.net/11573/362188
http://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=PARTNER_APP&SrcAuth=LinksAMR&KeyUT=000250387800004&DestLinkType=FullRecord&DestApp=ALL_WOS&UsrCustomerID=0c7ff228ccbaaa74236f48834a34396a
http://www.scopus.com/inward/record.url?eid=2-s2.0-34548509229&partnerID=65&md5=f5d951eec48907c60a5407ca086bd765

Zugang prüfen (DOI)

Save to List