L. A. Goldberg. Efficient Algorithms for Listing Combinatorial Structures. Cambridge University Press, Cambridge, England, 1993. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
A Survey of Combinatorial Gray Codes - Savage (1996) (23 citations) (Correct)
.... for early work on Gray codes are [Ehr73] and [NW78] For a comprehensive treatment of Gray codes and other topics in combinatorial generation, we look forward to the book in preparation by Ruskey [Rus95] Additional information on Gray codes also appears in the survey of Squire [Squ94a] In [Gol93], Goldberg considers generating combinatorial structures for which achieving even polynomial delay is hard. For surveys on related material, see [Als81] for long cycles in vertex transitive graphs, Gou91] for hamiltonian cycles, WG84] and the recent update [CG96] for Cayley graphs, and [Sed77] ....
L. A. Goldberg. Efficient Algorithms for Listing Combinatorial Structures. Cambridge University Press, Cambridge, 1993.
A Formal Framework for Evaluating Heuristic Programs - Cowen, Feigenbaum, Kannan (Correct)
....matchings in G; in this example, the family S is the set of all perfect matchings, and the parameter values are graphs G. Similarly, a listing program could take as input a graph G and output the list of all spanning trees of G. For an excellent introduction to the theory of listing, see Goldberg [4]. We restrict attention to listing programs that run in polynomial total time, i.e. in time polynomial in n 1 The expression n c is used here as a symbolic representation of the running time of the Adleman Huang algorithm. We tried to find out what the exponent c is and instead discovered, in ....
....the first output configuration and the time between any two consecutive output configurations are both bounded by a polynomial in the size of the input. This stricter property is not needed for our statements about timers to be meaningful. These and other measures of efficiency are discussed in [4]. Listing programs conform to our intuitive notion of heuristics, because the running time of such a program on input p is in general very hard to calculate; the length of the list S(p) is obviously a lower bound on this running time, but this length is often hard to compute. Interestingly, ....
L. Goldberg, Efficient Algorithms for Listing Combinatorial Structures, Cambridge University Press, Cambridge UK, 1993.
Listing All Minimal Separators of a Graph - Kloks, Kratsch (1998) (12 citations) (Correct)
....for obtaining polynomial time treewidth and minimum fill in algorithms. Thereby the vertex set of the separator graph is the set of all minimal separators of the given graph. Typically applications require our listing algorithm. For listing other types of combinatorial structures we refer to [9]. 2 Preliminaries If G = V; E) is a graph and W V a subset of vertices then we use G[W ] as a notation for the subgraph of G induced by the vertices of W . For a vertex x 2 V we use N (x) to denote the neighborhood of x. The following definition can be found for example in [10] ....
Goldberg, L. A., Efficient algorithms for listing combinatorial structures, Cambridge University Press, 1993.
A Formal Framework for Evaluating Heuristic Programs - By Lenore (Correct)
....matchings in G; in this example, the family S is the set of all perfect matchings, and the parameter values are graphs G. Similarly, a listing program could take as input a graph G and output the list of all spanning trees of G. For an excellent introduction to the theory of listing, see Goldberg [4]. We restrict attention to listing programs that run in polynomial total time, i.e. in time polynomial in n (the length of the input) and C (the length of the output) This restriction is imposed in order to rule out certain simple minded listing programs that have trivial complete timers. For ....
....the first output configuration and the time between any two consecutive output configurations are both bounded by a polynomial in the size of the input. This stricter property is not needed for our statements about timers to be meaningful. These and other measures of efficiency are discussed in [4]. Listing programs conform to our intuitive notion of heuristics, because the running time of such a program on input p is in general very hard to calculate; the length of the list S(p) is obviously a lower bound on this running time, but this length is often hard to compute. The number of ....
L. Goldberg, Efficient Algorithms for Listing Combinatorial Structures, Cambridge University Press, Cambridge UK, 1993.
A Census Of Steiner Triple Systems And Some Related Combinatorial.. - Kaski (2003) (Correct)
No context found.
L. A. Goldberg. Efficient Algorithms for Listing Combinatorial Structures. Cambridge University Press, Cambridge, England, 1993.
Comparing Performance of Algorithms for Generating Concept.. - Kuznetsov, Obedkov (9 citations) (Correct)
No context found.
Goldberg, L.A., Efficient Algorithms for Listing Combinatorial Structures, Cambridge University Press, 1993.
Cataloguing General Graphs by Point and Line Spectra - Fulling, Borosh, Conturbia (1998) (Correct)
No context found.
L. A. Goldberg, Efficient Algorithms for Listing Combinatorial Structures (Cambridge University Press, Cambridge, 1993).
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC