A Transportation Network Efficiency Measure that Captures Flows, Behavior, and Costs with Applications to Network Component Importance Identification and Vulnerability Anna Nagurney and Qiang Qiang Isenberg School of Man

First Page		Document Content
Date: 2007-04-11 06:27:40 Theoretical computer science Networks Network flow Cybernetics Network science Flow network Shortest path problem Network topology Anna Nagurney Graph theory Network theory Mathematics		A Transportation Network Efficiency Measure that Captures Flows, Behavior, and Costs with Applications to Network Component Importance Identification and Vulnerability Anna Nagurney and Qiang Qiang Isenberg School of Man Add to Reading List Source URL: supernet.isenberg.umass.edu Download Document from Source Website File Size: 149,50 KB Share Document on Facebook

	A Paged Domain Name System for Query Privacy Daniele E. Asoni, Samuel Hitz, and Adrian Perrig Network Security Group Department of Computer Science, ETH Zürich {daniele.asoni,samuel.hitz,adrian.perrig}@inf.ethz.ch DocID: 1xVqa - View Document
	Chemical Reaction Network Designs for Asynchronous Logic Circuits∗ Luca Cardelli1,2 , Marta Kwiatkowska1 , and Max Whitby1 1 Department of Computer Science, University of Oxford DocID: 1xUS1 - View Document
	Probabilistic Model Checking of Contention Resolution in the IEEELow-Rate Wireless Personal Area Network Protocol Matthias Fruth School of Computer Science, University of Birmingham, Edgbaston, Birmingham, B15 DocID: 1xTBs - View Document
	Control-data plane intelligence trade-off in SDN Yash Sinha, Siddharth Bhatia Birla Institute of Technology and Science, Pilani, India Abstract— With the decoupling of network control and data DocID: 1xTsL - View Document
	WHITE PAPER “Individual science fiction stories may seem as trivial as ever to the blinder critics and philosophers of today - but the DocID: 1xTny - View Document