Harary, F., and Palmer, E.: Graphical enumeration, Academic Press, 1973, New York. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents Next 50
Partial Dependency Separation - A - New Concept For (Correct)
....the other is represented by a directed edge in a graph, then there are 4 such models for a set of n variables. If causal cycles are forbidden, then the number of possible (acyclic) graph models is still immense: always more than 2 ) for 12 variables it is:521 939 651 343 829 405 020 504 063 [5]. Even if the ordering of the variables consistent with the given directed acyclic graph (dag) is known, the number of possibilities remains large: for 12 variables it is 7 Delta 10 19 . A scientist addressing problem areas where causal questions are of concern is therefore faced with an ....
Hilary F., Palmer E.: Graphical Enumeration, Academic Press, New York 1973.
Enumerative Applications of a Decomposition for Graphs and Digraphs - Gessel (1993) (2 citations) (Correct)
....only on isomorphism class. If # is a class of weighted graphs, its exponential generating function is the formal power series s n , where s n is the sum of the weights of all graphs in # with vertex set [n] 2, n . The exponential formula for graphs (see, e.g. Harary and Palmer [10]) asserts that if f(u)isthe exponential generating function for a class # of connected graphs, then e is the exponential generating function for graphs all of whose connected components are in # (where the weight of a graph is the product of the weights of connected components) It follows that ....
F. Harary and E. M. Palmer, Graphical Enumeration, Academic Press, New York, 1973.
Error-Correcting Graphs for Software Watermarking - Collberg, Kobourov, Carter, .. (Correct)
....#cient algorithm for correcting the error introduced by the adversary. For example, we may choose our watermark from the class PPCT of planted planar cubic trees; see Fig. 3(e) The enumeration of these trees is especially straightforward and e#cient, for they follow a Catalan recurrence [9]. This class has moderate data rate, approximately 0.5 bits per word. The class PPCT is very stealthy, for it may be represented by the commonly encountered binary tree data structure, although it has two quirks. Each non leaf node has exactly two children, except for a root node that has ....
F. Harary and E. Palmer. Graphical Enumeration. Academic Press, New York, 1973.
Counting Claw-Free Cubic Graphs - Edgar Palmer Ronald Self-citation (Palmer) (Correct)
No context found.
F. Harary and E. M. Palmer, Graphical Enumeration, Academic Press, New York, 1973.
The Asymptotic Number of Claw-free Cubic Graphs - McKay, Palmer, al. (2002) Self-citation (Palmer) (Correct)
....as well as the known asymptotic behavior of cubic general graphs (see [BeC78] W79a] or [CPR0x] The second method takes a more direct approach using inclusion and exclusion, which eliminates considerable fussing over negligible contributions. For general graph theoretic terminology we use [HP73] except for adopting the more conventional names nodes and edges instead of points and lines . We assume a basic knowledge of labeled enumeration techniques using egf s, such as is found in Chapter 1 of [HP73] as well as the terminology developed in [PaRR0x] used to characterize claw free ....
....over negligible contributions. For general graph theoretic terminology we use [HP73] except for adopting the more conventional names nodes and edges instead of points and lines . We assume a basic knowledge of labeled enumeration techniques using egf s, such as is found in Chapter 1 of [HP73], as well as the terminology developed in [PaRR0x] used to characterize claw free cubic graphs. From here on we frequently refer to the later as cfc s. In a cfc a node may be in exactly two triangles precisely if it is a node of degree 3 in an induced subgraph isomorphic to K 4 Gamma e; we call ....
HARARY, F. & PALMER, E.M., Graphical Enumeration, Academic, New York (1973).
A rigorous implementation - Of The Jeans--Landau--Teller (Correct)
No context found.
Harary, F., and Palmer, E.: Graphical enumeration, Academic Press, 1973, New York.
Submitted to the Department of Electrical Engineering and.. - Science In Partial (Correct)
No context found.
F. Harary and E.M.Palmer. Graphical Enumeration. Academic Press, 1973.
On The Number Of Distinct Languages Accepted By Finite.. - Domaratzki, al. (2002) (2 citations) (Correct)
No context found.
F. Harary, E. M. Palmer, Graphical Enumeration. Academic Press, 1973.
The Quantification of Succinctly Representable Regular Languages - van Zijl (1999) (Correct)
No context found.
F. Harary and E.M. Palmer, Graphical Enumeration. Academic Press, New York, 1973. 20 40 60 80 100 5 state binary intersection nfa
Error-Correcting Graphs for Software Watermarking - Collberg, Kobourov, Carter, .. (Correct)
No context found.
F. Harary and E. Palmer. Graphical Enumeration. Academic Press, New York, 1973.
The Number of Labelled k-Arch Graphs - Lamathe (2004) (Correct)
No context found.
F. Harary and E. Palmer, Graphical Enumeration, Academic Press, 1973.
Counting Transitive Relations - Pfeiffer (2004) (Correct)
No context found.
Frank Harary and Edgar M. Palmer, Graphical enumeration, Academic Press, New York, 1973. MR 50 #9682
Enumerative problems inspired by Mayer's theory of cluster.. - Leroux (2004) (Correct)
No context found.
F. Harary and E. M. Palmer. Graphical Enumeration, Academic Press, New York and London, 1973, 271 p.
Airy Phenomena and Analytic Combinatorics of Connected Graphs - Flajolet, Salvy, Schaeffer (2004) (1 citation) (Correct)
No context found.
Harary, F., and Palmer, E. M. Graphical Enumeration. Academic Press, 1973.
Dynamic Graph-Based Software Watermarking - Collberg, Thomborson, Townsend (2004) (1 citation) (Correct)
No context found.
Frank Harary and E. Palmer. Graphical Enumeration. Academic Press, New York, 1973.
Enumerative problems inspired by Mayer's theory of cluster.. - Leroux (2004) (Correct)
No context found.
F. Harary and E. M. Palmer. Graphical Enumeration, Academic Press, New York and London, 1973, 271 p.
Problems in Geometric Probing - Skiena (1989) (11 citations) (Correct)
No context found.
Frank Harary and Edgar M. Palmer, Graphical Enumeration, Academic Press, NewYork (1973). 7
Structural and Computational Properties of Certain Permanents - Crespi (Correct)
No context found.
F. Harary and E.M. Palmer. Graphical enumeration. Academic Press, New York (1973).
Airy Phenomena and Analytic Combinatorics of Connected Graphs - Flajolet, Salvy, Schaeffer (2004) (1 citation) (Correct)
No context found.
Harary, F., and Palmer, E. M. Graphical Enumeration. Academic Press, 1973.
For 3-Edge-Connectivity - Feng Sun Under (Correct)
No context found.
F. Harary and E. M. Palmer, Graphical Enumeration, Academic Press, New York, NY, 1973.
Bipartite, k-Colorable and k-Colored Graphs - Finch (2003) (Correct)
No context found.
F. Harary and E. M. Palmer, Graphical Enumeration, Academic Press, 1973, pp. 16-18; MR0357214 (50 #9682).
Polynomial Aspects of Codes, Matroids and Permutation Groups - Cameron (Correct)
No context found.
F. Harary and E. M. Palmer, Graphical Enumeration, Academic Press, New York, 1973.
On the Number of Distinct Languages Accepted by Finite.. - Domaratzki, Kisman.. (2001) (2 citations) (Correct)
No context found.
F. Harary and E. M. Palmer. Graphical Enumeration. Academic Press, 1973.
Enumeration of P4-Free Chordal Graphs - Castelo, Wormald (Correct)
No context found.
F. Harary and E. M. Palmer, Graphical Enumeration, Academic Press, New York, 1973.
Identity Digraphs of Minimum Size - Harary, Robinson (Correct)
No context found.
F. Haray and E.M. Palmer, Graphical Enumeration, Academic Press, New York (1973).
First 50 documents Next 50
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