Vertex Neighborhoods, Low Conductance Cuts, and Good Seeds for Local Community Methods David F. Gleich∗ C. Seshadhri†

Source URL: www.cs.princeton.edu

• Graph theory
• Mathematics
• Discrete mathematics
• Algebraic graph theory
• Network theory
• Networks
• Network analysis
• Vertex
• Conductance
• Clustering coefficient
• Graph partition
• Neighbourhood

Booting from an NVMe* PCIe* Intel Solid-State Drive Booting from an NVMe* PCIe* Intel Solid-State Drive Technology Brief April 2015

Source URL: download.intel.com

• Booting
• BIOS
• Boot loaders
• NVM Express
• Unified Extensible Firmware Interface
• Windows 8
• EFI system partition
• Multi-booting
• Solid-state drive
• PCI Express
• SATA Express
• Features new to Windows 8

Minimum clique partition in unit disk graphs Adrian Dumitrescu∗ J´anos Pach† August 31, 2009

Source URL: www.cs.uwm.edu

A Deterministic Partition Function Approximation for Exponential Random Graph Models

Source URL: ijcai.org

Spectral Analysis of Communication Networks Using Dirichlet Eigenvalues ∗ Alexander Tsiatas

Source URL: www2013.wwwconference.org

• Mathematics
• Algebra
• Graph theory
• Algebraic graph theory
• Matrices
• Spectral graph theory
• Graph partition
• Spectral theory
• Expander graph
• Cheeger constant
• Spectral clustering
• Laplacian matrix

⇥⇤⌅⇧⌃⌥ ⌫⌃⇠⌃⌥⇡⇢ ⌧ ⌦↵ ⌦ ✏⇣ ⌘⌥✓ ◆✓

Source URL: www.bic.kyoto-u.ac.jp

• Graph theory
• Networks
• Graph
• Network theory
• Graph partition

COMPATIBLE TRIANGULATIONS AND POINT PARTITIONS BY SERIES-TRIANGULAR GRAPHS JEFF DANCIGER, SATYAN L. DEVADOSS, AND DON SHEEHY Abstract. We introduce series-triangular graph embeddings and show how to partition point sets

Source URL: donsheehy.net

AX3650S Series Compact gigabit layer 3 switches that achieve reliable, wide-area virtual networks with multiple sites The AX3650S is the series of compact gigabit layer 3 switches supporting Network Partition, a feature

Source URL: www.alaxala.com

Chapter 10 Bin Packing Here we consider the classical Bin Packing problem: We are given a set I = {1, . . . , n} of items, where item i ∈ I has size si ∈ (0, 1] and a set B = {1, . . . , n} of bins with capacity one

Source URL: www2.informatik.hu-berlin.de

• Computational complexity theory
• Theory of computation
• Complexity classes
• Packing problems
• NP-complete problems
• Bin packing problem
• Approximation algorithms
• Polynomial-time approximation scheme
• Partition problem
• NP
• NC
• Time complexity

Computability of Width of Submodular Partition Functions Petr Škoda ∗

Source URL: iti.mff.cuni.cz