Gibbons, Alan (1985). Algorithmic Graph Theory. New York: Cambridge University Press. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents Next 50
Simpler Projective Plane Embedding - Jianping Roth Creo (Correct)
....This is followed by an analysis of the time complexity. The rst step of our algorithm is to nd the maximal 2 vertex connected subgraphs (blocks) of the input graph as is standard in any embedding algorithm. This can be done in O(n) time using a modi ed depth rst search (see for example [18]) It is well known that if all the blocks are planar except one which could be projective planar, then G is projective planar. Thus, the pseudocode below is for a simple graph G which has no cut vertices. It either computes a projective planar embedding of G or returns false to indicate that no ....
A. Gibbons. Algorithmic graph theory. Cambridge University Press, New York, 1985. 19
An Optimal Algorithm for the Automatic Generation of.. - Benso, Di Carlo, Di.. (2002) (Correct)
....part of the second TP. The use of GTSs with minimum number of operation seems a good choice since there is a strict correlation between the GTS length and the March test complexity. The generation of minimum length GTSs is a typical instance of the Asymmetric Traveling Salesman Problem (ATSP)[11] . The ATSP is probably the most well known member of the wider field of the combinatorial optimization problem. In a general instance of the ATSP, one is given V nodes and a matrix d i,j storing the distance or cost function to go from node i to node j . A tour consists of a list of V nodes, ....
A. Gibbons, "Algorithmic Graph Theory" , Cambridge University Press 1985.
On the Performance and Feasibility of Multicast Core Selection .. - Fleury, Huang (2000) (24 citations) (Correct)
....graph. Each node in that graph is then replaced by another random connected graph and nally, each node is again replaced by another random graph. For a xed number of nodes, these graphs tend to have a longer diameter than purely random graphs, a characteristic of computer network topologies [10]. The diameter of our randomly generated graphs is approximately 10. Arguably, these graphs re ect the hierarchical structure typical of many networks. Each statistic reported here is the average of 1000 simulation runs performed for each given network and core selection heuristic. For each ....
A. Gibbons, Algorithmic graph theory. Cambridge University Press, 1985.
Computing the Representation Polynomial for Directed Acyclic .. - Jackson, Humphres (Correct)
....A description of graph theory terminology utilized in this paper follows. A graph is defined to be a pair (X, U) where X is a set x 1 , x 2 , x n of elements referred to as vertices, and U is a family (u 1 , u 2 , u m ) of elements of the Cartesian product X X, referred to as arcs [1 2]. The degree of a vertex, d G (x) is the number of arcs incident to x [5] The number of arcs incident out of a vertex, the outer demi degree, is denoted as d G (x) The number of arcs incident into a vertex, the inner demi degree, is denoted as d G (x) The degree of a vertex x is thus ....
Gibbons, Alan. Algorithmic Graph Theory. Camridge University Press, 1985.
A Category-Theoretic Approach to Social Network Analysis - Dekker (2001) (Correct)
....Gulf War. 1 Introduction Social Network Analysis [14] is an approach to analysing organisations focusing on the relationships between people and or groups as the most important aspect. Going back to the 1950 s, it is characterised by adopting mathematical techniques especially from graph theory [7,9]. It has applications in organisational psychology, sociology and anthropology. The first goal of Social Network Analysis is to visualise communication and other relationships between people and or groups by means of diagrams. The second goal is to study the factors which influence relationships ....
Gibbons, Alan, "Algorithmic Graph Theory," Cambridge University Press, 1985.
An Ontological-Semantic Framework for Text Analysis - Onyshkevych (1997) (1 citation) (Correct)
No context found.
Gibbons, Alan (1985). Algorithmic Graph Theory. New York: Cambridge University Press.
On Providing ATM Multipoint Services Survivability - Yurcik (1998) (Correct)
No context found.
A. Gibbons, Algorithmic Graph Theory, Cambridge University Press, Cambridge U.K., 1985.
Towards Reliable Modelling with Stochastic Process Algebras - Bradley (1999) (Correct)
No context found.
Silva #57#,pp. 139#154. #32# Gibbons, A. Algorithmic Graph Theory. Cambridge University Press, 1985.
Protection Cycles in Mesh WDM Networks - Ellinas, Hailemariam, Stern (2000) (11 citations) (Correct)
No context found.
A. Gibbons, Algorithmic Graph Theory. Cambridge, U.K.: Cambridge University Press, 1985.
Deterministic Key Predistribution Schemes - For Distributed Sensor (Correct)
No context found.
A. Gibbons. Algorithmic Graph Theory, Cambridge Univ. Press, Cambridge, 1985.
The Hopcroft-Tarjan Planarity Algorithm - Kocay (1993) (Correct)
No context found.
Alan Gibbons, Algorithmic Graph Theory,Cambridge University Press, Cambridge, U.K., 1985.
Using a Minimal Number of Resets when Testing from a Finite State .. - Hierons (2004) (Correct)
No context found.
A. Gibbons. Algorithmic Graph Theory. Cambridge University Press, 1985.
On the Determination of the Optimum Path in Space - Stefanakis, Kavouras (1995) (Correct)
No context found.
A. Gibbons: `Algorithmic Graph Theory', Cambridge University Press Ltd, 1985.
Optimization of Splitting Node Placement in Wavelength-Routed.. - Ali (2002) (Correct)
No context found.
A. Gibbons, Algorithmic Graph Theory. New York: Cambridge Univ. Press, 1985.
Automatic Creation of Boundary-Representation Models from Single.. - Varley (2002) (Correct)
No context found.
A.Gibbons. Algorithmic Graph Theory,Cambridge University Press, 1985. 366
Power-Efficient Design of Multicast Wavelength-Routed Networks - Ali, Deogun (2000) (5 citations) (Correct)
No context found.
A. Gibbons, Algorithmic Graph Theory. New York: Cambridge University Press, 1985.
JUMBL: A Tool for Model-Based Statistical Testing - Prowell (2003) (Correct)
No context found.
A.M. Gibbons, Algorithmic Graph Theory, Cambridge: Cambridge University Press, 1985.
The Complexity of Planarity Testing - Allender, Mahajan (2003) (1 citation) (Correct)
No context found.
A. Gibbons. Algorithmic Graph Theory. Cambridge University Press, 1985.
The practitioner's guide to coloured Petri nets - Kristensen, Christensen, Jensen (1998) (9 citations) (Correct)
No context found.
Gibbons, A.: Algorithmic Graph Theory. Cambridge University Press, 1985
Simplified O(n) Planarity Algorithms - Boyer, Myrvold (2001) (Correct)
No context found.
Alan Gibbons. Algorithmic Graph Theory. Cambridge University Press, 1985. 40
IEEE TRANSACTIONS ON SYSTEMS, MAN, AND.. - Capacitated.. (Correct)
No context found.
A. Gibbons, Algorithmic Graph Theory. Cambridge, U.K.: Cambridge Univ., 1985.
Scheduling Interviews for a Job Fair - Bartholdi, III, McCroan (2003) (Correct)
No context found.
A. Gibbons (1985). Algorithmic Graph Theory, Cambridge University Press.
Characterization and Parameterized Generation of.. - Hutton, Rose.. (1998) (7 citations) (Correct)
No context found.
A. Gibbons. Algorithmic Graph Theory. Cambridge University Press, Great Britain, 1985.
S. K. Chang, Q. Y. Shi, and C. W. Yam Iconic Indexing of.. - Erland Jungert Extended (Correct)
No context found.
Alan Gibbons. Algorithmic Graph Theory. Cambridge University Press, Cam- bridge, England, 1985.
Minimizing the cost of Fault Location when testing from a Finite.. - Hierons (Correct)
No context found.
Gibbons A. 1985. Algorithmic Graph Theory, Cambridge University Press.
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