Simultaneous Lobe-Vertex and Membrane-Vertex Recording Technique in ABR

نویسندگان
چکیده

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

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

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

منابع مشابه

Simultaneous Feedback Vertex Set: A Parameterized Perspective

For a family of graphs F , a graph G, and a positive integer k, the F-Deletion problem asks whether we can delete at most k vertices from G to obtain a graph in F . F-Deletion generalizes many classical graph problems such as Vertex Cover, Feedback Vertex Set, and Odd Cycle Transversal. A graph G = (V,∪i=1Ei), where the edge set of G is partitioned into α color classes, is called an α-edge-colo...

متن کامل

Constructing vertex decomposable graphs

‎Recently‎, ‎some techniques such as adding whiskers and attaching graphs to vertices of a given graph‎, ‎have been proposed for constructing a new vertex decomposable graph‎. ‎In this paper‎, ‎we present a new method for constructing vertex decomposable graphs‎. ‎Then we use this construction to generalize the result due to Cook and Nagel‎.

متن کامل

Vertex Lie algebras, vertex Poisson algebras and vertex algebras

The notions of vertex Lie algebra and vertex Poisson algebra are presented and connections among vertex Lie algebras, vertex Poisson algebras and vertex algebras are discussed.

متن کامل

Vertex Removable Cycles of Graphs and Digraphs

‎In this paper we defined the vertex removable cycle in respect of the following‎, ‎if $F$ is a class of graphs(digraphs)‎ ‎satisfying certain property‎, ‎$G in F $‎, ‎the cycle $C$ in $G$ is called vertex removable if $G-V(C)in in F $.‎ ‎The vertex removable cycles of eulerian graphs are studied‎. ‎We also characterize the edge removable cycles of regular‎ ‎graphs(digraphs).‎    

متن کامل

The robust vertex centdian location problem with interval vertex weights on general graphs

In this paper, the robust vertex centdian  location  problem with uncertain vertex weights on general graphs is studied. The used criterion to solve the problem is the min-max  regret criterion. This problem  is  investigated  with objective function contains $lambda$  and  a polynomial time algorithm for the problem is presented. It is shown that the vertex centdian problem on general graphs i...

متن کامل

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


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

ژورنال

عنوان ژورنال: Practica Oto-Rhino-Laryngologica

سال: 1979

ISSN: 1884-4545,0032-6313

DOI: 10.5631/jibirin.72.1591