Wildlife corridors as a connected subgraph problem (Q456412): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(3 intermediate revisions by 3 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.jeem.2011.08.001 / rank
Normal rank
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.jeem.2011.08.001 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2027469956 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Steiner problem with edge lengths 1 and 2 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Connected Subgraph Problems in Wildlife Conservation / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the hardness of approximating minimum vertex cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Selection of a Connected Reserve Network / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5689037 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.JEEM.2011.08.001 / rank
 
Normal rank

Latest revision as of 18:06, 9 December 2024

scientific article
Language Label Description Also known as
English
Wildlife corridors as a connected subgraph problem
scientific article

    Statements

    Wildlife corridors as a connected subgraph problem (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    25 October 2012
    0 references
    wildlife corridors
    0 references
    habitat fragmentation
    0 references
    optimization
    0 references
    mixed integer programming
    0 references
    computational sustainability
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references