Library

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
  • 1
    Electronic Resource
    Electronic Resource
    On the complexity of graph reconstruction (1994)
    Springer
    Theory of computing systems 27 (1994), S. 257-273 
    Details
    ISSN: 1433-0490
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract In the wake of the resolution of the four-color conjecture, the graph reconstruction conjecture has emerged as one focal point of graph theory. This paper considers thecomputational complexity of decision problems (Deck Checking andLegitimate Deck), construction problems (Preimage Construction), and counting problems (Preimage Counting) related to the graph reconstruction conjecture. We show that: 1. $${\text{GRAPH}} {\text{ISOMORPHISM}} \leqslant _m^l LEGITIMATE DECK, and$$ 2 $${\text{GRAPH}} {\text{ISOMORPHISM}} \equiv _{iso}^l DECK CHECKING.$$ Relatedly, we display the first natural GI-hard NP set lacking obvious padding functions. Finally, we show thatLegitimate Deck, Preimage Construction, andPreimage Counting are solvable in polynomial time for graphs of bounded degree, partialk-trees for any fixedk, and graphs of bounded genus, in particular for planar graphs.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01578845
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 2
    Electronic Resource
    Electronic Resource
    A counterexample about poset reconstruction (1994)
    Springer
    Order 11 (1994), S. 95-96 
    Details
    ISSN: 1572-9273
    Keywords: 06A07 ; Reconstruction
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract We give a negative answer to two questions of B. Sands related to poset reconstruction.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01108595
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 3
    Electronic Resource
    Electronic Resource
    Finding Hamiltonian paths in cocomparability graphs using the bump number algorithm (1991)
    Springer
    Order 8 (1991), S. 383-391 
    Details
    ISSN: 1572-9273
    Keywords: 05C45 ; Hamiltonian paths and cycles ; partial orders ; bump number ; cocomparability graphs
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract Hamiltonian Path/Cycle are well known NP-complete problems on general graphs, but their complexity status for permutation graphs has been an open question in algorithmic graph theory for many years. In this paper, we prove that theHamiltonian Path problem is solvable in polynomial time even for the larger class of cocomparability graphs. Our result is based on a nice relationship between Hamiltonian paths and the bump number of partial orders. As another consequence we get a new interpretation of the bump number in terms of path partitions, leading to polynomial time solutions of theHamiltonian Path/Cycle Completion problems in cocomparability graphs.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF00571188
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 4
    Electronic Resource
    Electronic Resource
    Towards the reconstruction of posets (1994)
    Springer
    Order 11 (1994), S. 317-341 
    Details
    ISSN: 1572-9273
    Keywords: 06A07 ; Reconstruction ; Kelly lemma ; reconstructible parameter ; classes of posets
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract The reconstruction conjecture for posets is the following: “Every finite posetP of more than three elements is uniquely determined — up to isomorphism — by its collection of (unlabelled) one-element-deleted subposets 〈P−{x}:x∈V(P)〉.” We show that disconnected posets, posets with a least (respectively, greatest) element, series decomposable posets, series-parallel posets and interval orders are reconstructible and that N-free orders are recognizable. We show that the following parameters are reconstructible: the number of minimal (respectively, maximal) elements, the level-structure, the ideal-size sequence of the maximal elements, the ideal-size (respectively, filter-size) sequence of any fixed level of the HASSE-diagram and the number of edges of the HASSE-diagram. This is considered to be a first step towards a proof of the reconstruction conjecture for posets.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01108765
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 5
    Book
    Book
    Exact Exponential Algorithms / (2010)
    Berlin, Heidelberg :Springer-Verlag Berlin Heidelberg,
    Details
    Title: Exact Exponential Algorithms /
    Author: Fomin, Fedor V.
    Contributer: Kratsch, Dieter
    Publisher: Berlin, Heidelberg :Springer-Verlag Berlin Heidelberg,
    Year of publication: 2010
    Pages: XIII, 203 S.
    Series Statement: Texts in Theoretical Computer Science. An EATCS Series
    ISBN: 978-3-642-16533-7 , 978-3-642-16532-0
    Type of Medium: Book
    Language: English
    URL: http://www.zentralblatt-math.org/zmath/en/advanced/?q=an:pre05817382&format=complete
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    ZIB Catalog
    Zuse Institute Berlin get availability status
  • 6
    facet.materialart.
    Unknown
    On exact algorithms for treewidth (2006)
    Details
    Publication Date: 2014-11-10
    Description: We give experimental and theoretical results on the problem of computing the treewidth of a graph by exact exponential time algorithms using exponential space or using only polynomial space. We first report on an implementation of a dynamic programming algorithm for computing the treewidth of a graph with running time $O^\ast(2^n)$. This algorithm is based on the old dynamic programming method introduced by Held and Karp for the {\sc Tra veling Salesman} problem. We use some optimizations that do not affect the worst case running time but improve on the running time on actual instances and can be seen to be practical for small instances. However, our experiments show that the space use d by the algorithm is an important factor to what input sizes the algorithm is effective. For this purpose, we settle the problem of computing treewidth under the restriction that the space used is only polynomial. In this direction we give a simple $O^\ast(4^n)$ al gorithm that requires {\em polynomial} space. We also show that with a more complicated algorithm, using balanced separators, {\sc Treewidth} can be computed in $O^\ast(2.9512^n)$ time and polynomial space.
    Keywords: ddc:000
    Language: English
    Type: reportzib , doc-type:preprint
    Format: application/pdf
    Format: application/postscript
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    OPUS
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...