「Graphs」の共起表現一覧(1語右で並び替え)
該当件数 : 504件
| cal error-correcting codes are based on sparse | graphs, achieving close to the Shannon limit. |
| In addition, Paley | graphs actually form an infinite family of conference |
| Graphs, algorithms, and optimization By William Kocay | |
| There are four isomorphism class of | graphs, also shown at the right. |
| defines a class of perfect cochromatic | graphs, analogous to the definition of perfect graphs |
| For an overview of the theory of intersection | graphs, and of important special classes of intersect |
| l-quasi-ordering on the isomorphism classes of | graphs, and implies that many other families of graph |
| membered for his famous conjectures on perfect | graphs and for Berge's lemma, which states that a mat |
| paration may be defined in the same way as for | graphs, and results in a partition of the set M of ma |
| rithmic-linear, logarithmic-logarithmic, polar | graphs and pie charts, normal and stacked bar charts, |
| It is capable of explicit and parametric | graphs and uses a (very simple) code-oriented layout |
| nting non-syntactic data models such as object | graphs and directed labeled graphs, based on the data |
| ing larger graph family consists of the cactus | graphs and disjoint unions of multiple cactus graphs. |
| is a measure of disconnectedness in ancestral | graphs and a generalization of d-separation for direc |
| ings and maximum weight matchings in bipartite | graphs and finding arborescences in directed graphs. |
| The same concepts apply both to undirected | graphs and directed graphs, with the edges being dire |
| telligence and operations research, constraint | graphs and hypergraphs are used to represent relation |
| XLfit generates 2D and 3D | graphs and analyses data sets produced by any type of |
| concerns algebraic properties of invariants of | graphs, and especially the chromatic polynomial, the |
| has written a dozen papers on iterated clique | graphs and on the history of mathematics. |
| Complex | Graphs and Networks (CBMS Regional Conference Series |
| xt output and supports mathematical formula in | graphs and figures. |
| It is an XML format for serializing Named | Graphs and RDF Datasets which offers a compact and re |
| h Latin squares and decompositions of complete | graphs and also combinatorics games. |
| It featured interactive world maps and | graphs and charts of international statistics, and se |
| aic graph theory, particularly the symmetry of | graphs and the action of finite groups on combinatori |
| A clique-sum of two planar | graphs and the Wagner graph, forming a K5-free graph. |
| 86 paper with Karen Vogtmann called "Moduli of | graphs and automorphisms of free groups". |
| t is a plain text format for serializing Named | Graphs and RDF Datasets which offers a compact and re |
| It saves | graphs and graph grammar rules as XML files and is wr |
| Graphs and Applications: An Introductory Approach (wi | |
| son's doctoral dissertation was on signal flow | graphs and he is often credited with inventing them. |
| In planar | graphs, and more generally in families of graphs clos |
| StreetPrices was the first site to offer price | graphs and price alerts (both released by December 19 |
| Classes for | graphs and digraphs. |
| materials such as strip chart recordings, old | graphs, and graphs published in journals. |
| In the study of | graphs and networks, the degree of a node in a networ |
| obabilistic combinatorics, particularly random | graphs and in the analysis of algorithms: In the stud |
| es, fuzzy matching, but also basic statistics, | graphs and geographical visualization. |
| Reeb | graphs and contour trees have a wide variety of appli |
| Coloring can also be considered for signed | graphs and gain graphs. |
| In his papers on qualitative logic, entitative | graphs, and existential graphs, Peirce developed seve |
| the general problem and for special classes of | graphs, and theoretical investigations of its computa |
| r visualization of dependencies using directed | graphs and dependency matrix. |
| known for the Foster census of cubic symmetric | graphs and the 90-vertex cubic symmetric Foster graph |
| nd-held calculator that is capable of plotting | graphs and solving complex functions. |
| Panconnected | graphs and are also a generalization of Hamiltonian-c |
| These data are displayed as | graphs and pie charts. |
| brain neurons, voter networks, telephone call | graphs, and social influence networks. |
| ical results, displayed in 240 charts, tables, | graphs and maps. |
| h theory and recognized for his work on planar | graphs and graph drawing. |
| NetworkX is a Python library for studying | graphs and networks. |
| The spreadsheets as well as | graphs and note windows are gathered in a project and |
| testing is useful for generation of molecular | graphs and for computer synthesis. |
| mplements belong to the class of comparability | graphs, and the comparability relations are precisely |
| ifa, 2003) and the International Conference on | Graphs and Optimization (GO V, Leukerbad, Switzerland |
| me anticipated uses of canvas include building | graphs, animations, games, and image composition. |
| For undirected | graphs Anshelevich and others presented a tight bound |
| Graphs application changes | |
| Thus, symmetric relations and undirected | graphs are combinatorially equivalent objects. |
| All complete | graphs are their own maximal cliques. |
| the strong perfect graph theorem, the perfect | graphs are the graphs with no odd hole and no odd ant |
| 2003 p. 31-33) notes, most of the oracle bone | graphs are not depicted realistically enough for thos |
| For simplicity, only connected | graphs are considered, however the DCEL structure may |
| Two | graphs are called isospectral or cospectral if the ad |
| Paley | graphs are quasi-random (Chung et al. 1989): the numb |
| Where | graphs are defined so as to allow multiple edges and |
| The distance-hereditary | graphs are the graphs in which every induced path is |
| Some reasons to be interested in gain | graphs are their connections to network flow theory i |
| Power | Graphs are not another generalization of graphs, but |
| These | graphs are forbidden minors for F: a graph belongs to |
| The trivially perfect | graphs are the graphs that have neither an induced pa |
| Critical | graphs are interesting because they are the minimal m |
| Such | graphs are called semi-symmetric graphs and were firs |
| Once satisfactory | graphs are obtained (acid/base amount--pH, and pH--ze |
| In fact, chordal | graphs are precisely the graphs that are both odd-hol |
| In graph theory, the Laman | graphs are a family of sparse graphs describing the m |
| Symmetric | graphs are also vertex-transitive (if they are connec |
| cribes the connectivity of its level sets.Reeb | graphs are named after Georges Reeb. |
| Skip | graphs are a kind of distributed data structure based |
| Apex | graphs are closed under the operation of taking minor |
| Skip | graphs are mostly used in searching peer-to-peer netw |
| Graphs are switching equivalent if one can be obtaine | |
| An order-theoretic analog to the intersection | graphs are the containment orders. |
| Graphs are an expressive, visual and mathematically p | |
| Complete | graphs are distance regular with diameter 1 and degre |
| Circular-arc | graphs are useful in modeling periodic resource alloc |
| A set of | graphs are provided at the back of the book so that t |
| In projective geometry, Levi | graphs are a form of bipartite graph used to model th |
| The connected 3-regular (cubic) simple | graphs are listed for small vertex numbers. |
| Interval | graphs are useful in modeling resource allocation pro |
| If the edge relations of the two | graphs are order relations, then the edge relation of |
| W. T. Tutte showed that all 4-connected planar | graphs are hamiltonian. |
| luding the case of degree 2, where the largest | graphs are cycles with an odd number of vertices). |
| Laman | graphs are named after Gerard Laman, of the Universit |
| Dependency | graphs are computed for the operands of assembly or i |
| Although voltage | graphs are defined for digraphs, they may be extended |
| Block | graphs are examples of pseudo-median graphs: for ever |
| In general the largest degree-diameter | graphs are much smaller in size than the Moore bound. |
| mber of the vertices of the graph, two labeled | graphs are said to be isomorphic if the corresponding |
| shown by H. Whitney, states that two connected | graphs are isomorphic if and only if their line graph |
| l of certain types of electric networks, these | graphs are of interest in computational complexity th |
| Interval | graphs are chordal graphs and hence perfect graphs. |
| However, some important classes of | graphs are incapable of realizing all groups as their |
| Where | graphs are defined so as to disallow multiple edges a |
| Chordal | graphs are a subset of the perfect graphs. |
| These | graphs are strongly regular graphs with parameters : |
| The | graphs are publication-quality. |
| because if the vertex-deleted subgraphs of two | graphs are isomorphic, then the corresponding vertice |
| All such | graphs are bipartite, and hence can be colored with o |
| Rook's | graphs are highly symmetric perfect graphs; they may |
| Overfull | graphs are Class 2. |
| In particular, rook's | graphs are themselves perfect. |
| Where | graphs are defined so as to allow loops and multiple |
| Where | graphs are defined so as to disallow loops and multip |
| Elaborations of these | graphs are reminiscent of adinkra weavings; the term |
| Overfull | graphs are of odd order. |
| The Chang | graphs are srg(28,12,6,4). |
| Because of this decomposition, and because odd | graphs are not bipartite, they have chromatic number |
| The triangle-free | graphs are bull-free graphs, since every bull contain |
| omplementation operator, whereas only complete | graphs are periodic with respect to the operator that |
| In the above definition, | graphs are understood to be undirected non-labeled no |
| The chordal | graphs are a subclass of the well known perfect graph |
| Planar | graphs are also not capable of realizing all groups a |
| For this reason, the 3-connected planar | graphs are also known as polyhedral graphs. |
| Johnson | graphs are closely related to the Johnson scheme, bot |
| The block | graphs are the graphs in which there is at most one i |
| Gabriel | graphs are named after K. R. Gabriel, who introduced |
| Two other | graphs are chromatically equivalent to the bull graph |
| clic graph; unless stated otherwise, trees and | graphs are undirected. |
| Panconnected | graphs are necessarily pancyclic: if uv is an edge, t |
| ynomial-time algorithms for max-cut in general | graphs are known. |
| Since the vertex sets of (finite) | graphs are commonly identified with the intervals of |
| Therefore other, less dense constraint | graphs are considered. |
| The | graphs are represented as an abstract "model". |
| Since median | graphs are closed under retraction, and include the h |
| The linklessly embeddable | graphs are closed under graph minors and Y-Δ transfor |
| Since the | graphs are Hamiltonian, the vertices can be arranged |
| Graphs are drawn with circles or points that represen | |
| ypical higher-level operations associated with | graphs are: finding a path between two nodes, like de |
| Laman | graphs arise in rigidity theory: if one places the ve |
| s and Wagner's characterizations of the planar | graphs as being the graphs that do not contain K5 or |
| specially important in the context of expander | graphs as it is a way to measure the edge expansion o |
| ycles were investigated by , who applied these | graphs as the interconnection pattern of a network co |
| blished by Prindle, Weber & Schmidt in 1977 as | Graphs as Mathematical Models |
| Chartrand, Gary (1977), | Graphs as Mathematical Models, Prindle, Weber & Schmi |
| only if it does not contain one of these nine | graphs as an induced subgraph. |
| sciences, supports export of semantic network | graphs as XGMML files |
| to Wagner's theorem characterizing the planar | graphs as the graphs having neither the complete grap |
| also use simplex | graphs as part of their proof that testing whether a |
| r on the set of all distinct finite undirected | graphs, as it obeys the three axioms of partial order |
| mportant open problem concerning unit distance | graphs asks how many edges they can have relative to |
| These can be displayed as line | graphs, bar graphs, cross sectional plots or on maps. |
| a system which automatically defines series of | graphs, based on information available to the user. |
| For cubic | graphs, biconnectivity and bridgelessness are equival |
| problem holds also for some special classes of | graphs: bipartite graphs, complements of bipartite gr |
| ting U may obtain a disjoint union of complete | graphs, but the case where it does not is the more in |
| oxeter group), because they differ as directed | graphs, but agree as undirected graphs - direction ma |
| ing that the same holds not only for bipartite | graphs, but also for any loopless multigraph. |
| l Conference on the Theory and Applications of | Graphs by the Western Michigan University in May 1988 |
| d to that of finding large independent sets in | graphs, by the following reduction. |
| One can edit the appearance of | graphs by changing line colors, adding patterns to re |
| clique-sums and k-clique-sums of more than two | graphs, by repeated application of the two-graph cliq |
| Grapher is able to create animations of | graphs by changing constants or rotating them in spac |
| matics, a clique-sum is a way of combining two | graphs by gluing them together at a clique, analogous |
| One may also enumerate the polyhedral | graphs by their numbers of vertices: for graphs with |
| ally given in terms of data flow or dependency | graphs by extending the typical operational semantics |
| Introduction to the theory of | graphs By Mehdi Behzad, Gary Chartrand, Published by |
| complete bipartite subgraph, forms two smaller | graphs by replacing each of the two sides of the part |
| n Charles Golumbic and Ann N. Trenk, Tolerance | Graphs, Cambridge University Press, 2004. |
| A universal graph for a family F of | graphs can also refer to a member of a sequence of fi |
| ivalent way of stating this is that any set of | graphs can have only a finite number of minimal eleme |
| at the number of Eulerian circuits in directed | graphs can be computed in polynomial time, a problem |
| The symmetries of hypercube | graphs can be represented as signed permutations. |
| Graphs can be classified into amplifiers of selection | |
| Letters, phrases, subgraphs, and entire | graphs can be True' or False; |
| Named | graphs can be represented this way, as <graphname> <s |
| Extracting (x,y) data from scanned | graphs can be useful for analyzing data from publishe |
| Because the edges of ordinary | graphs can only have two vertices (one at each end), |
| itizing tablet for hours to digitize manually, | graphs can be digitized automatically in seconds. |
| A limited range of statistical | graphs can be produced, such as histograms, pie-chart |
| Bipartite | graphs can model the more general multigraph. |
| Constraint | graphs capture the restrictions of relative movements |
| ging or running activities through a series of | graphs, charts and statistics, as well as set goals f |
| of this conjecture implies that any family of | graphs closed under the operation of taking minors (a |
| They are the trees whose line | graphs contain a Hamiltonian path; such a path may be |
| Gri can make x-y | graphs, contour graphs, and image graphs, outputting |
| This article is about | Graphs defined on a continuous space. |
| the Petersen graph, the Coxeter graph and two | graphs derived from the Petersen and Coxeter graphs b |
| e, so may the maximum independent sets of line | graphs, despite the hardness of the maximum independe |
| of computer science research papers, including | graphs, diagrams, and citations. |
| But rather than making these | graphs directly using commands, students construct th |
| n season, the use of real-time viewer-response | graphs during presidential debates, and the controver |
| is suitable for operation on large real-world | graphs: e.g., graphs in excess of 10 million nodes an |
| ch, and a smaller one with nine lines of eight | graphs each, neatly arranged as if in a grid. |
| to implement the random selection of r-regular | graphs efficiently and in an unbiased way, since most |
こんにちは ゲスト さん
ログイン |
Weblio会員(無料)になると
|
検索履歴を保存できる！
こんにちは ゲスト さん
|
ログイン |
Weblio会員(無料)になると
|
