Isoperimetric functions for graph products

نویسندگان

چکیده

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

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

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

منابع مشابه

Isoperimetric Invariants For Product Markov Chains and Graph Products

Bounds on some isoperimetric constants of the Cartesian product of Markov chains are obtained in terms of related isoperimetric quantities of the individual chains.

متن کامل

Isoperimetric Inequalities for Cartesian Products of Graphs

We give a characterization for isoperimetric invariants, including the Cheeger constant and the isoperimetric number of a graph. This leads to an isoperimetric inequality for the cartesian products of graphs.

متن کامل

new graph products for configuration processing

for the analysis of structures, the first step consists of configuration processing followed by data generation. this step is the most time consuming part of the analysis for large-scale structures. in this paper new graph products called triangular and circular graph products are developed for the formation of the space structures. the graph products are extensively used in graph theory and co...

متن کامل

Interactive cosegmentation by Isoperimetric Graph Partitioning

An interactive method for cosegmentation using isoperimetric graph partitioning is proposed. I use a joint image graph, which merges two individual weight matrices of an image pair and the correspondence matrix between the pair. By combining pixel similarity and feature correspondence which contains object information, the semantic quality of segmentation is improved. This algorithm only requir...

متن کامل

Vertex isoperimetric parameter of a Computation Graph

Let G = (V, E) be a computation graph, which is a directed graph representing a straight line computation and S ⊂ V . We say a vertex v is an input vertex for S if there is an edge (v, u) such that v ∕∈ S and u ∈ S. We say a vertex u is an output vertex for S if there is an edge (u, v) such that u ∈ S and v ∕∈ S. A vertex is called a boundary vertex for a set S if it is either an input vertex o...

متن کامل

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


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

ژورنال

عنوان ژورنال: Journal of Pure and Applied Algebra

سال: 1995

ISSN: 0022-4049

DOI: 10.1016/0022-4049(94)00060-v