J. Gross and J. Yellen. Graph Theory and Its Applications. New York, CRC Press, 1999. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Solving Minimum Vertex Cover: A Fast.. - Stege, van Rooij (2002) (Correct)
....is an acyclic graph. We call a tree rooted if it has a distinguished vertex, called root. For a rooted tree that consists of more than 2 vertices we assume that the root r is of degree deg T (r) 2. We use the standard de nitions of parent and child relationship between vertices in rooted trees [GY99]. A pendant vertex in a tree is called a leaf. Let v; w 2 V T such that w. is parent of v. Then T v denotes the by v induced subtree of T . That is, T v is the connected component of T (v; w) that contains vertex v. 1.2 Fixed parameter tractability The theory of parameterized complexity was ....
....decision problem is called xed parameter As in PC, in EWPC (u; v) 2 E PC;G (V ) if (1) u; v) 2 E and (2) u 2 V . For simplicity, for the weight of an edge (u; v) we write w(u; v) instead of w( u; v) For more information on notational conventions and terminology we refer to [GY99] for algorithms and graph theory, and to [GJ79] for the theory of NP completeness. Stege and van Rooij tractable, if for every instance (I ; k) it can be solved in time pol(jI j)f(k) where pol is a polynomial function in the input size and f is a function depending on k only. The (parameterized) ....
J. Gross and J. Yellen, Graph theory and its applications (1999), CRC Press.
Workflow Modeling for Virtual Processes: an Order-Preserving.. - Liu, Shen (2002) (Correct)
....and induces ambiguities in the evaluation of exit conditions. Leymann F. et al 14] also claims that race conditions may occur in arbitrary loops. Thus, this work prescribes that a loop must be single entry and single exit. A graphical representation of a process resembles a directed graph [5] in which each node is an activity and each directed edge is a dependency. This work uses a rectangle to denote an activity and a solid arrow to represent a dependency in a process graph. Moreover, a blank arrow indicates a loop dependency used to construct a loop structure. Figure 1 depicts a ....
J. L. Gross and J. Yellen, Graph Theory and Its Applications. CRC Press, 1999.
International Organization For Standardization Organisation .. - July Beijing Title (Correct)
....# Simplified Naming. The names of the various elements of the new Graph DS have been shortened (i.e. EntityRelationGraphDS becomes GraphDS, RelationshipNode becomes Relation DS, etc) Use of the term relationship has been replaced with relation following standard mathematical terminology [14]. # Cross Document Linking. The syntax of the Graph DS has changed so that relations may reference not only entities in the same document but also external entities using an URI reference use of IDREF was changed to uriReference. # Relation Properties. A separate DS Relation Property DS has ....
....set of relation types has been defined: pre orders, equivalence relations, etc. # N ary Relation Syntax. It is now possible to specify a role name to name arguments of n ary relations. 3. 2 Formalization The initial work on formalizing relation and graphs in the Mathematical Models for [14] was used as a starting point for the work in this CE. The work reported in this section assumes a familiarity with category theory and categorical logic. The reader who is not familiar with these is advised to focus only on the requirements, which are highlighted. 3.2.1 Analysis of Requirements ....
Gross J., Yellen J, "Graph Theory and its Applications", CRC Press, 1999.
Efficient Scheduling of Complete Exchange on Clusters - Tam, Wang (2000) (Correct)
....we assume a complete graph, the solution to our schedule problem is to find an algorithm for edge coloring the complete graph. Due to the unique feature of the complete graph, there exists a simple numerable solution similar to the XOR bitwise operation for p3, and is being described and proved in [2]. By incorporated this algorithm to the pairwise complete exchange scheme, we have the generalized pairwise exchange solution to the complete exchange operation (Figure 3) Regarding the communication complexity, this algorithm has the same communication cost as compared to the shift exchange ....
J. Gross and J. Yellen. Graph Theory and its Applications, CRC press, 1999
Thomas Wolle - Arie Koster Hans (2004) (Correct)
No context found.
J. Gross and J. Yellen. Graph Theory and Its Applications. New York, CRC Press, 1999.
With Few Crossings Per Edge - Alexander Grigoriev Hans (2004) (Correct)
No context found.
J. Gross and J. Yellen. Graph Theory and Its Applications. New York, CRC Press (1999).
A Mozart Implementation of CP(BioNet) - Gregoire Dooms Yves (Correct)
No context found.
Jonathan Gross and Jay Yellen. Graph Theory and its Applications. CRC Press, 1999.
Constrained Path Finding in Biochemical Networks - Gregoire Dooms Yves (2004) (Correct)
No context found.
Jonhatan Gross and Jay Yellen. Graph Theory and its Applications. CRC Press, 1999.
Technical Report - Department Of Computer (1998) (5 citations) (Correct)
No context found.
J. Gross and J. Yellen. Graph Theory and its Applications. CRC Press, 1999.
ProTest: An Automatic Test Environment for B Specifications - Manoranjan Satpathy Michael (Correct)
No context found.
J. Gross, J. Yellen, Graph Theory and its Applications, CRC Press, 1999.
High Performance Interconnection Networks - Harwood (2002) (Correct)
No context found.
Jonathan Gross and Jay Yellen. Graph Theory and its Applications. CRC Press, 1998.
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