Vertex Separators for Partitioning a Graph

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Vertex Separators for Partitioning a Graph

Finite Element Method (FEM) is a well known technique extensively studiedfor spatial and temporal modeling of environmental processes, weather predictioncomputations, and intelligent signal processing for wireless sensors. The need for hugecomputational power arising in such applications to simulate physical phenomenoncorrectly mandates the use of massively parallel computers to distribute the ...

متن کامل

Hypergraph Partitioning through Vertex Separators on Graphs

The modeling flexibility provided by hypergraphs has drawn a lot of interest from the combinatorial scientific community, leading to novel models and algorithms, their applications, and development of associated tools. Hypergraphs are now a standard tool in combinatorial scientific computing. The modeling flexibility of hypergraphs however, comes at a cost: algorithms on hypergraphs are inheren...

متن کامل

Partitioning Multivariate Polynomial Equations via Vertex Separators for Algebraic Cryptanalysis and Mathematical Applications

We present a novel approach for solving systems of polynomialequations via graph partitioning. The concept of a variable-sharing graph of asystem of polynomial equations is defined. If such graph is disconnected, thenthe system of equations is actually two separate systems that can be solvedindividually. This can provide a significant speed-up in computing the solutionto the...

متن کامل

Graph Separators: A Parameterized View

Graph separation is a well-known tool to make (hard) graph problems accessible to a divide-and-conquer approach. We show how to use graph separator theorems in combination with (linear) problem kernels in order to develop fixed parameter algorithms for many wellknown NP-hard (planar) graph problems. We coin the key notion of glueable select&verify graph problems and derive from that a prospecti...

متن کامل

Partitioning Hypergraphs in Scientific Computing Applications through Vertex Separators on Graphs

The modeling flexibility provided by hypergraphs has drawn a lot of interest from the combinatorial scientific community, leading to novel models and algorithms, their applications, and development of associated tools. Hypergraphs are now a standard tool in combinatorial scientific computing. The modeling flexibility of hypergraphs however, comes at a cost: algorithms on hypergraphs are inheren...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Sensors

سال: 2008

ISSN: 1424-8220

DOI: 10.3390/s8020635