Algorithmic graph theory
نویسنده
چکیده
Introduction to graphs, Paths, cycles and trails Max-flow min-cut theorem, computing max s-t flows and min-cut Edge and Vertex Connectivity and Menger's theorem Maximum matching, Hall's theorem, algorithms for computing maximum matching in weighted and unweighted graphs. Edge and vertex colouring of graphs. Independent sets Planar graphs and algorithms for checking for planarity. The course needs to focus on survey of work on interactive systems, explore the current and future research areas in interaction techniques and the design, prototyping, and evaluation of user interfaces. Topics include user interface toolkits; design methods; evaluation methods; ubiquitous and context-aware computing; tangible interfaces; Research papers on these topics need to be discussed with the background that the student is registered in Ph. D and needs to understand the way papers present the work, conduct the experimental studies and prepare summary on these followed by presentations. Special Topics in Computer Networks Real-time and non-real-time applications: Quality of Service (QOS) requirements of real-time applications – bandwidth, delay and delay variation parameters, Quality of service metrics, guaranteed and best-effort services. Performance analysis of WLAN distributed protocol functions: Random variables and random process, Markov chain model of DCF and EDCA protocols, Throughput and delay analysis. Use of the techniques for web usage mining, user tracking and profiling, web content and structure mining, web personalization, text mining, spatial mining, bioinformatics and other scientific applications.
منابع مشابه
Probabilistic Sufficiency and Algorithmic Sufficiency from the point of view of Information Theory
Given the importance of Markov chains in information theory, the definition of conditional probability for these random processes can also be defined in terms of mutual information. In this paper, the relationship between the concept of sufficiency and Markov chains from the perspective of information theory and the relationship between probabilistic sufficiency and algorithmic sufficien...
متن کاملWorkshop: Algorithmic Graph Theory Table of Contents
The main focus of this workshop was on mathematical techniques needed for the development of efficient solutions and algorithms for computationally difficult graph problems. The techniques studied at the workshhop included: the probabilistic method and randomized algorithms, approximation and optimization, structured families of graphs and approximation algorithms for large problems. The worksh...
متن کاملGraph Minors and Parameterized Algorithm Design
The Graph Minors Theory, developed by Robertson and Seymour, has been one of the most influential mathematical theories in parameterized algorithm design. We present some of the basic algorithmic techniques and methods that emerged from this theory. We discuss its direct meta-algorithmic consequences, we present the algorithmic applications of core theorems such as the grid-exclusion theorem, a...
متن کاملThe Bidimensionality Theory and Its Algorithmic Applications
This paper surveys the theory of bidimensionality. This theory characterizes a broad range of graph problems (‘bidimensional’) that admit efficient approximate or fixed-parameter solutions in a broad range of graphs. These graph classes include planar graphs, map graphs, bounded-genus graphs and graphs excluding any fixed minor. In particular, bidimensionality theory builds on the Graph Minor T...
متن کاملLocal Majority Voting, Small Coalitions and Controlling Monopolies in Graphs: A Review
This paper provides an overview of recent developments concerning the process of local majority voting in graphs, and its basic properties, from graph theoretic and algorithmic standpoints.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1990