ALBERT

All Library Books, journals and Electronic Records Telegrafenberg

X
feed icon rss

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
Filter
  • Articles  (3)
  • 68 E 10  (3)
  • Springer  (3)
  • American Chemical Society
  • American Chemical Society (ACS)
  • American Geophysical Union
  • IOS Press
  • Institute of Electrical and Electronics Engineers (IEEE)
  • National Academy of Sciences
  • 2015-2019
  • 2005-2009
  • 1990-1994
  • 1980-1984  (3)
  • 2017
  • 2009
  • 1983  (3)
  • Computer Science  (3)
  • Process Engineering, Biotechnology, Nutrition Technology
Collection
  • Articles  (3)
Source
Keywords
Publisher
  • Springer  (3)
  • American Chemical Society
  • American Chemical Society (ACS)
  • American Geophysical Union
  • IOS Press
    • +
Years
  • 2015-2019
  • 2005-2009
  • 1990-1994
  • 1980-1984  (3)
Year
  • 2017
  • 2009
  • 1983  (3)
  • 1981  (1)
Topic
  • Computer Science  (3)
  • Process Engineering, Biotechnology, Nutrition Technology
  • 1
    Electronic Resource
    Electronic Resource
    An improved transitive closure algorithm (1983)
    Springer
    Computing 30 (1983), S. 359-371 
    Details
    ISSN: 1436-5057
    Keywords: 68 E 10 ; Digraphs ; strongly connected components ; transitive closure ; transitive reduction
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Zusammenfassung Verschiedene effiziente Transitive-Hülle-Algorithmen arbeiten auf den stark zusammenhängenden Komponenten eines gerichteten Graphen; einige davon verwenden den Algorithmus von Tarjan [17]. Wir nützen Sachverhalte aus der Graphentheorie und die speziellen Eigenschaften von Tarjans Algorithmus aus, um einen neuen, verbesserten Algorithmus zu entwickeln. Die transitive Reduktion eines gerichteten Graphen, wie sie in [1] definiert wird, läßt sich als Nebenprodukt bestimmen.
    Notes: Abstract Several efficient transitive closure algorithms operate on the strongly connected components of a digraph, some of them using Tarjan's algorithm [17]. Exploiting facts from graph theory and the special properties of Tarjan's algorithm we develop a new, improved algorithm. The transitive reduction of a digraph defined in [1] may be obtained as a byproduct.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF02242140
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 2
    Electronic Resource
    Electronic Resource
    Determining the interval number of a triangle-free graph (1983)
    Springer
    Computing 31 (1983), S. 347-354 
    Details
    ISSN: 1436-5057
    Keywords: 05 C 99 ; 68 E 10 ; Intersection graph ; m-interval model ; algorithmic determination of the interval number
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Zusammenfassung Als Intervallzahli (G) eines GraphenG mitn Ecken bezeichnet man die kleinste natürliche Zahlm, so daßG der Schnittgraph einer Familie von MengenI 1, ...,I n ist, bei der jedesI i aus der Vereinigung von höchstensm reellen Intervallen besteht. Für den Fall, daßG dreikreisfrei ist, wird eine Idee zur algorithmischen Bestimmung voni (G) angegeben. Ein Anwendungsbeispiel wird ebenfalls angegeben.
    Notes: Abstract The interval numberi (G) of a graphG withn vertices is the lowest integerm such thatG is the intersection graph of some family of setsI 1, ...,I n with everyI i being the union of at mostm real intervals. In this article, an idea is presented for the algorithmic determination ofi (G), ifG is triangle-free. An example for the application of these considerations is given.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF02251237
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 3
    Electronic Resource
    Electronic Resource
    The complexity of determining a shortest cycle of even length (1983)
    Springer
    Computing 31 (1983), S. 355-369 
    Details
    ISSN: 1436-5057
    Keywords: 68 C 25 ; 68 E 10 ; Shortest cycles ; efficient algorithms
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Zusammenfassung Wir untersuchen das Problem, einen kürzesten Kreis gerader Länge (bzw. ungerader Länge) zu bestimmen Für Kreise ungerader Länge erhalten wir die gleiche Komplexität wie bei der Bestimmung eines kürzesten Kreises in einem Graphen, d. h. 0 (|V|·|E|) im Falle ungewichteter Graphen und 0 (|V|3) im Falle gewichteter Graphen. Das Hauptergebnis dieser Arbeit ist ein Algorithmus, der einen kürzesten Kreis gerader Länge in einem ungewichteten und ungerichteten Graphen im wesentlichen in der Zeit 0 (|V|2) berechnet.
    Notes: Abstract We study the problem of determining a shortest cycle of even length (or of odd length, respectively). For cycles of odd length we get the same complexity as for determining a shortest cycle of a graph i. e. 0 (|V|·|E|) in the case of unweighted graphs and 0 (|V|3) in the case of weighted graphs. The main contribution of this paper is an algorithm computing the shortest cycle of even length of an unweighted undirected graph within essentially 0 (|V|2) time.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF02251238
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...