Open Advanced Search

Log in
Enterprise Plans
Sign Up

Log in
Sign Up
Enterprise Plans
Browse
Features
Pricing

DeepDyve

Advanced Search

show/hide query preview

With all of the words or DOIs:

DeepDyve's default query mode: search by keyword or DOI.

With the exact phrase:

Require these words, in this exact order. Do not surround your terms in double-quotes ("") in this field.

With at least one of the words:

Find any of these words, separated by spaces

Without the words:

Exclude each of these words, separated by spaces

With words in the article title:

Search for these terms only in the title of an article

Published between the years:

With the following authors:

Most effective as: LastName, First Name or Lastname, FN

With words in the journal name:

Search for articles published in journals where these words are in the journal name

Reset filters

Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

DeepDyve requires Javascript to function. Please enable Javascript on your browser to continue.

A Graph-Theoretic Approach to Enterprise Network Dynamics

Part of the Progress in Computer Science and Applied Logic (PCS) Book Series (volume 24)

DOI: 10.1007/978-0-8176-4519-9

ISBN: 978-0-8176-4485-7

Publisher: Birkhäuser Boston - Springer Journals

Jan 1, 2007

1 - 10 of 12 Chapters

LitStream

Intranets and Network Management

Pages: 3 –29

[The origin of the Internet and TCP/IP protocol suite date back to 1969, when the Advanced Research Projects Agency (ARPA) funded a research and development project to create a packet-switched network, named the ARPANET. The aim was to demonstrate techniques to provide a heterogeneous, robust,...
LitStream

Graph-Theoretic Concepts

Pages: 31 –40

[We are going to discuss the structure of several kinds of communications networks. In every case, the network consists of a number of individuals, or nodes, and certain relationships between them.]
LitStream

Matching Graphs with Unique Node Labels

Pages: 43 –61

[In its most general form, graph matching refers to the problem of finding a mapping f from the nodes of one given graph g1 to the nodes of another given graph g2 that satisfies some constraints or optimality criteria. For example, in graph isomorphism detection [130], mapping f is a bijection...
LitStream

Graph Similarity Measures for Abnormal Change Detection

Pages: 63 –78

[In managing large-enterprise data networks, the ability to measure network changes in order to detect abnormal trends is an important performance monitoring function [17]. The early detection of abnormal network events and trends can provide advance warning of possible fault conditions [171], or...
LitStream

Median Graphs for Abnormal Change Detection

Pages: 79 –92

[In Chapter 4, abnormal network behavior was detected based on the distance of a pair of graphs. In this chapter we derive more general procedures that use more than just two graphs. Considering a larger number of graphs, it can be expected that abnormal event detection procedures will exhibit...
LitStream

Graph Clustering for Abnormal Change Detection

Pages: 93 –114

[Graph similarity measures, including graph edit distance, and their application to the detection of abnormal change in telecommunication networks were introduced in Chapter 4. In Section 3.3, the median of a set of graphs was studied. Also this concept has proven useful to measure change in...
LitStream

Graph Distance Measures based on Intragraph Clustering and Cluster Distance

Pages: 115 –130

[Various graph distance measures were considered in previous chapters. All of these measures have in common that the distance of two given graphs g1 and g2 is equal to zero if and only if g1 and g2 are isomorphic to each other. Sometimes, however, it may be desirable to have a more flexible...
LitStream

Matching Sequences of Graphs

Pages: 131 –143

[In the current chapter we are going to address a new problem in the domain of graph matching. All algorithms for graph distance computation discussed previously in this book consider just a pair of graphs g and G, and derive their distance d(g, G). Our proposed extension consists in computing...
LitStream

Distances, Clustering, and Small Worlds

Pages: 147 –164

[In previous chapters we have discussed distance between graphs. In this chapter we shall consider distance between vertices in a graph.]
LitStream

Tournament Scoring

Pages: 165 –173

[Various methods have been used to assess the relative strengths of players in round-robin tournaments. These methods involve the digraph representing the results of the tournament. (Somewhat confusingly, this digraph is also called a “tournament.”) In this chapter we shall generalize these...

results per page

Browse All eBooks

Features

Search and discover articles on DeepDyve, PubMed, and Google Scholar
Read the full-text of open access and premium content
Organize articles with folders and bookmarks
Collaborate on and share articles and folders

Info

Pricing
Enterprise Plans
Browse Journals & Topics
About DeepDyve

Help

Help
Publishers
Contact Us

Sign up for your DeepDyve account now!

Read and print from thousands of top scholarly journals.

System error. Please try again!

By signing up, you agree to DeepDyve’s Terms of Service and Privacy Policy.

Already have an account? Log in

Save Article to Bookmarks

Bookmark this article. You can see your Bookmarks on your DeepDyve Library.

To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.

Subscribe to Journal Email Alerts

To subscribe to email alerts, please log in first, or sign up for a DeepDyve account if you don’t already have one.

Follow a Journal

To get new article updates from a journal on your personalized homepage, please log in first, or sign up for a DeepDyve account if you don’t already have one.

Our policy towards the use of cookies

All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.

cookie policy