Scribd Logo
Upload

Welcome to Scribd!

  • 4K views

    Clique and Coloring Problems Graph Format

    Uploaded by

    Marko Bukal
    PDF describing DIMACS format for storing and reading graphs (graph as a network). DIMACS format dates all the way back to early 90s when competitions in solving NP and NP-complete problems were held by Center for Discrete Mathematics and Computer Science.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd

    Clique and Coloring Problems Graph Format

    Uploaded by

    Marko Bukal
    4K views6 pages
    PDF describing DIMACS format for storing and reading graphs (graph as a network). DIMACS format dates all the way back to early 90s when competitions in solving NP and NP-complete problems were held by Center for Discrete Mathematics and Computer Science.

    Original Title

    Cc Format

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    PDF describing DIMACS format for storing and reading graphs (graph as a network). DIMACS format dates all the way back to early 90s when competitions in solving NP and NP-complete problems were held by Center for Discrete Mathematics and Computer Science.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    4K views6 pages

    Clique and Coloring Problems Graph Format

    Uploaded by

    Marko Bukal
    PDF describing DIMACS format for storing and reading graphs (graph as a network). DIMACS format dates all the way back to early 90s when competitions in solving NP and NP-complete problems were held by Center for Discrete Mathematics and Computer Science.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    of 6

    Clique and Coloring Problems

    Graph Format
    Last revision: May 08, 1993

    This paper outlines a suggested graph format. If you have comments on


    this or other formats or you have information you think should be included,
    please send a note to challenge@dimacs.rutgers.edu.

    1 Introduction
    One purpose of the DIMACS Challenge is to ease the e ort required to test
    and compare algorithms and heuristics by providing a common testbed of
    instances and analysis tools. To facilitate this e ort, a standard format must
    be chosen for the problems addressed. This document outlines a format for
    graphs that is suitable for those looking at graph coloring and nding cliques
    in graphs. This format is a exible format suitable for many types of graph
    and network problems. This format was also the format chosen for the First
    Computational Challenge on network ows and matchings.
    This document describes three problems: unweighted clique, weighted
    clique, and graph coloring. A separate format is used for satis ability.

    2 File Formats for Graph Problems


    This section describes a standard le format for graph inputs and outputs.
    There is no requirement that participants follow these speci cations; however,
    compatible implementations will be able to make full use of DIMACS support
    tools. (Some tools assume that output is appended to input in a single le.)
    1

    Participants are welcome to develop translation programs to convert instances to and from more convenient, or more compact, representations; the
    Unix awk facility is recommended as especially suitable for this task.
    All les contain ASCII characters. Input and output les contain several
    types of lines, described below. A line is terminated with an end-of-line
    character. Fields in each line are separated by at least one blank space.
    Each line begins with a one-character designator to identify the line type.
    2.1

    Input Files

    An input le contains all the information about a graph needed to de ne


    either a clique problem or a coloring problem. Some information may be
    included that is not relevant to one problem (for instance, node weights are
    not needed for coloring problem) so that information may be ignored.
    In this format, nodes are numbered from 1 up to n. There are m edges
    in the graph.
    Files are assumed to be well-formed and internally consistent: node identi er values are valid, nodes are de ned uniquely, exactly m edges are de ned,
    and so forth. A input checker will be made available to ensure compatibility
    with this standard.
     Comments. Comment lines give human-readable information about
    the le and are ignored by programs. Comment lines can appear anywhere in the le. Each comment line begins with a lower-case character
    c.
    c This is an example of a comment line.

     Problem line. There is one problem line per input le. The problem
    line must appear before any node or arc descriptor lines. For network
    instances, the problem line has the following format.
    p FORMAT NODES EDGES

    The lower-case character p signi es that this is the problem line. The
    FORMAT eld is for consistency with the previous Challenge, and should
    contain the word \edge". The NODES eld contains an integer value
    specifying n, the number of nodes in the graph. The EDGES eld contains an integer value specifying m, the number of edges in the graph.
    2

     Node Descriptors. For this Challenge, a node descriptor is required


    only for the weighted clique problem. These lines will give the weight
    assigned to a node in the clique. There is one node descriptor line for
    each node, with the following format. Nodes without a descriptor will
    take on a default value of 1.
    n ID VALUE

    The lower-case character n signi es that this is a node descriptor line.


    The ID eld gives a node identi cation number, an integer between 1
    and n. The VALUE gives the objective value for having this node in the
    clique. This value is assumed to be integer and can be either positive
    or negative (or zero).
     Edge Descriptors. There is one edge descriptor line for each edge
    the graph, each with the following format. Each edge (v; w) appears
    exactly once in the input le and is not repeated as (w; v).
    e W

    The lower-case character e signi es that this is an edge descriptor line.


    For an edge (w; v) the elds W and V specify its endpoints.
     Optional Descriptors. In addition to the required information, there
    can be additional pieces of information about a graph. This will typically de ne the parameters used to generate the graph or otherwise
    de ne generator{speci c information. The following list may be added
    to as interesting problem generators are decided on:

    { Geometric Descriptors. One common method to generate or dis-

    play graphs is to have the nodes be embedded in some space and


    to have the edges be included according to some function of the
    distance between nodes according to some metric. The node information can be de ned by a dimension descriptor and a vertex
    embedding descriptor.
    d DIM METRIC

    is the dimension descriptor. DIM is an integer giving the number of dimensions of the space, while METRIC is a string representing the metric for the space. METRIC is a string that
    can take a number of forms. Lp (i.e. L1, L2, L122, and so on)
    denotes the `p norm where the distance between
    two nodes emP
    d
    bedded at (x1; x2; : : :; xd) and (y1; y2; : : : yd) is ( i=1 jxi yijp)1=p.
    The string LINF is used to denote the `1 norm. L2S denotes
    the squared euclidean norm (which can be less susceptible to
    computer{di erences in round{o and accuracy issues).
    v

    X1

    X2

    X3

    . .. XD

    The lower-case character v signi es that this is a vertex embedding


    descriptor line. The elds X1, X2 . . .XD give the d coordinate values for the vertex. Note that these lines must appear after
    the d descriptor.
    { Parameter Descriptors. The parameter descriptors are used to
    give other information about how the graph was generated. The
    lines are generator{speci c, and as such it is not expected that
    most codes will use most (or any) of them. They are included
    only to aid those codes speci cally designed to attack specially
    structured problems. The general form of the parameter descriptor is:
    x PARAM VALUE

    The lower-case character x signi es that this is a parameter descriptor line. The PARAM eld is a string that gives the name
    of the parameter, while the VALUE eld is a numeric value that
    gives the corresponding value. The following PARAM values have
    been de ned:
    PARAM
    Description
    MINLENGTH (Geometric Graphs) Edge included only if
    length greater than or equal to VALUE
    MAXLENGTH (Geometric Graphs) Edge included only if
    length less than or equal to VALUE
    Note that this information is in addition to the required edge
    descriptors.
    4

    2.2

    Output Files

    Every algorithm or heuristic should create an output le. This output le


    should consist of one or more of the following lines, depending on the type
    of algorithm and problem being solved.

     Solution Line
    s TYPE SOLUTION

    The lower{case character s signi es that this is a solution line. The


    TYPE eld denotes the type of solution contained in the le. This should
    be one of the following strings: \col" denotes a graph coloring, \clq"
    denotes a maximum weighted clique, and \cqu" denotes a maximum
    unweighted clique (one that has ignored the n descriptor lines).
    The SOLUTION eld contains an integer corresponding to the solution
    value. This is the clique size for unweighted clique, clique value for
    weighted clique, or number of colors used for graph coloring.

     Bound Line
    b BOUND

    The lower{case character b signi es that this is a bound on the the


    solution. The BOUND eld contains an integer value that gives a bound
    on the solution value. This bound is an upper bound on the maximum
    clique value for cliques and weighted clique and a lower bound on the
    number of colors needed for coloring the graph.

     Clique Line
    v V

    The lower-case character v signi es that this is a clique vertex line. The
    V eld gives the node number for the node in the clique. There will be
    one clique line for each node in the clique.

     Label Line

    l V N

    The lower-case character l signi es that this is a label line, generally


    used for graph coloring. The V eld gives the node number for the node
    in the clique while the N eld gives the corresponding label. There will
    be one label line for each node in the graph.

    You might also like

    pFad - Phonifier reborn

    Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

    Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


    Alternative Proxies:

    Alternative Proxy

    pFad Proxy

    pFad v3 Proxy

    pFad v4 Proxy