Optimizing in Graphs with Expensive Computation of Edge Weights (Q5391961): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q403651
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Gerhard Reinelt / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/978-3-540-77903-2_67 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1553123369 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on two problems in connexion with graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing Edge-Connectivity in Multigraphs and Capacitated Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing Best Transition Pathways in High-Dimensional Dynamical Systems: Application to the <i>Alpha<sub>L</sub></i> \leftrightharpoons <i>Beta</i> \leftrightharpoons <i>Alpha<sub>R</sub></i> Transitions in Octaalanine / rank
 
Normal rank

Latest revision as of 23:33, 3 July 2024

scientific article; zbMATH DE number 5875930
Language Label Description Also known as
English
Optimizing in Graphs with Expensive Computation of Edge Weights
scientific article; zbMATH DE number 5875930

    Statements

    Identifiers