Bibliothek

X
feed icon rss

Ihre E-Mail wurde erfolgreich gesendet. Bitte prüfen Sie Ihren Maileingang.

Leider ist ein Fehler beim E-Mail-Versand aufgetreten. Bitte versuchen Sie es erneut.

Vorgang fortführen?

Exportieren
Filter
  • Mathematics Subject Classification (1991): 05C70, 90C27  (2)
  • 94 B 60  (1)
  • 1
    Digitale Medien
    Digitale Medien
    Increasing the rooted-connectivity of a digraph by one (1999)
    Springer
    Mathematical programming 84 (1999), S. 565-576 
    Details
    ISSN: 1436-4646
    Schlagwort(e): Mathematics Subject Classification (1991): 05C70, 90C27
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Informatik , Mathematik
    Notizen: In order to unify these approaches, here we describe a two-phase greedy algorithm working on a slight extension of lattice polyhedra. This framework includes the rooted node-connectivity augmentation problem, as well, and hence the resulting algorithm, when appropriately specialized, finds a minimum cost of new edges whose addition to a digraph increases its rooted connectivity by one. The only known algorithm for this problem used submodular flows. Actually, the specialized algorithm solves an extension of the rooted edge-connectivity and node-connectivity augmentation problem.
    Materialart: Digitale Medien
    URL: http://dx.doi.org/10.1007/s101070050040
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
    Artikel (Nationallizenzen)
    Volltext
  • 2
    Digitale Medien
    Digitale Medien
    Covering symmetric supermodular functions by graphs (1999)
    Springer
    Mathematical programming 84 (1999), S. 483-503 
    Details
    ISSN: 1436-4646
    Schlagwort(e): Mathematics Subject Classification (1991): 05C70, 90C27
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Informatik , Mathematik
    Materialart: Digitale Medien
    URL: http://dx.doi.org/10.1007/s101070050034
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
    Artikel (Nationallizenzen)
    Volltext
  • 3
    Digitale Medien
    Digitale Medien
    Conservative weightings and ear-decompositions of graphs (1993)
    Springer
    Combinatorica 13 (1993), S. 65-81 
    Details
    ISSN: 1439-6912
    Schlagwort(e): 05 C 70 ; 05 C 75 ; 94 B 60
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Mathematik
    Notizen: Abstract A subsetJ of edges of a connected undirected graphG=(V, E) is called ajoin if |C∩J|≤|C|/2 for every circuitC ofG. Answering a question of P. Solé and Th. Zaslavsky, we derive a min-max formula for the maximum cardinality μ of a joint ofG. Namely, μ=(φ+|V|−1)/2 where φ denotes the minimum number of edges whose contraction leaves a factor-critical graph. To study these parameters we introduce a new decomposition ofG, interesting for its own sake, whose building blocks are factor-critical graphs and matching-covered bipartite graphs. We prove that the length of such a decomposition is always φ and show how an optimal join can be constructed as the union of perfect matchings in the building blocks. The proof relies on the Gallai-Edmonds structure theorem and gives rise to a polynomial time algorithm to construct the optima in question.
    Materialart: Digitale Medien
    URL: http://dx.doi.org/10.1007/BF01202790
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
    Artikel (Nationallizenzen)
    Volltext
Schließen ⊗
Diese Webseite nutzt Cookies und das Analyse-Tool Matomo. Weitere Informationen finden Sie hier...