Network Stability Assessment Using the Number of Tree Adjacent to an Articulation Node
ICCSA '08 Proceedings of the international conference on Computational Science and Its Applications, Part II
Network Stability Analysis Techniques Using the Virtual Articulation Node
APNOMS '08 Proceedings of the 11th Asia-Pacific Symposium on Network Operations and Management: Challenges for Next Generation Network Operations and Service Management
Web Service Request Transformatter
Proceedings of the 2006 conference on Advances in Intelligent IT: Active Media Technology 2006
Information Sciences: an International Journal
Counting the number of vertex covers in a trapezoid graph
Information Processing Letters
A gaia-driven approach for competitive multi-agent systems
ProMAS'11 Proceedings of the 9th international conference on Programming Multi-Agent Systems
Computing K-terminal reliability of d-trapezoid graphs
Information Processing Letters
Hi-index | 0.00 |
Designed to function as a textbook or as a professional reference, "Fundamentals of Data Structures in C" provides in-depth coverage of all aspects of data structure implementation in ANSI C. The book goes beyond the standard fare of stacks, queues, and lists to offer such features as afull chapter on search structures and a discussion of advanced tree structures. Recent data structure innovations rarelv found in other texts are presented, including Fibonacci Heaps, Splay Trees, Red-Black Trees, 2-3 Trees, 2-3-4 Trees, Leftist Trees, Binokcal Heaps, Min-Max Heaps, and Deaps.