Publications
Search

Publications :: Search

Making an Arbitrary Filled Graph Minimal by Removing Fill Edges.

Show publication

On this page you see the details of the selected publication.

    Publication properties
    Title: Making an Arbitrary Filled Graph Minimal by Removing Fill Edges.
    Rating: (not rated yet)
    Discussion: 0 comments
    Date: 1996
    Publication type: Conference paper
    Authors:
    No. First name Last name Show
    1. Jean R. S. Blair
    2. Pinar Heggernes
    3. Jan Arne Telle
    Download (by DOI): 10.1007/3-540-61422-2_130
    BibTeX: conf/swat/BlairHT96
    DBLP: db/conf/swat/swat96.html#BlairHT96
    Bookmark:

    The following keywords have been assigned to this publication so far. If you have logged in, you can tag this publication with additional keywords.

    Keywords
    No keywords have been assigned to this publication yet.

    If you log in you can tag this publication with additional keywords

    A publication can refer to another publication (outgoing references) or it can be referred to by other publications (incoming references).

    Incoming References
    No incoming references have been assigned to this publication yet.
    Outgoing References
    No outgoing references have been assigned to this publication yet.

    If you log in you can add references to other publications

    A publication can be assigned to a conference, a journal or a school.

    Conference
    Name: Algorithm Theory - SWAT '96, 5th Scandinavian Workshop on Algorithm Theory, Reykjavík, Iceland, July 3-5, 1996, Proceedings 1996
    DBLP: db/conf/swat/swat96.html