Relevant bibliographies by topics / Supergraphe

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Books
  4. Book chapters
  5. Conference papers

Academic literature on the topic 'Supergraphe'

Author: Grafiati
Published: 4 June 2021
Last updated: 14 February 2022

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Supergraphe.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Supergraphe"

1

Koch, Sebastian. "About Supergraphs. Part I." Formalized Mathematics 26, no. 2 (2018): 101–24. http://dx.doi.org/10.2478/forma-2018-0009.

Full text
Abstract:
Summary Drawing a finite graph is usually done by a finite sequence of the following three operations. 1. Draw a vertex of the graph. 2. Draw an edge between two vertices of the graph. 3. Draw an edge starting from a vertex of the graph and immediately draw a vertex at the other end of it. By this procedure any finite graph can be constructed. This property of graphs is so obvious that the author of this article has yet to find a reference where it is mentioned explicitly. In introductionary books (like [10], [5], [9]) as well as in advanced ones (like [4]), after the initial definition of gra
APA, Harvard, Vancouver, ISO, and other styles
2

Grisaru, M. T., and D. Zanon. "Covariant supergraphs." Nuclear Physics B 252 (January 1985): 578–90. http://dx.doi.org/10.1016/0550-3213(85)90463-8.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Grisaru, M. T., and D. Zanon. "Covariant supergraphs." Nuclear Physics B 252 (January 1985): 591–620. http://dx.doi.org/10.1016/0550-3213(85)90464-x.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Asahiro, Yuichi, Jesper Jansson, Eiji Miyano, Hirotaka Ono, and T. P. Sandhya. "Graph Orientation with Edge Modifications." International Journal of Foundations of Computer Science 32, no. 02 (2021): 209–33. http://dx.doi.org/10.1142/s012905412150012x.

Full text
Abstract:
The goal of an outdegree-constrained edge-modification problem is to find a spanning subgraph or supergraph [Formula: see text] of an input undirected graph [Formula: see text] such that either: (Type I) the number of edges in [Formula: see text] is minimized or maximized and [Formula: see text] can be oriented to satisfy some specified constraints on the vertices’ resulting outdegrees; or: (Type II) among all subgraphs or supergraphs of [Formula: see text] that can be constructed by deleting or inserting a fixed number of edges, [Formula: see text] admits an orientation optimizing some object
APA, Harvard, Vancouver, ISO, and other styles
5

Yamada, Masataka, and Akihiro Inokuchi. "Similar Supergraph Search Based on Graph Edit Distance." Algorithms 14, no. 8 (2021): 225. http://dx.doi.org/10.3390/a14080225.

Full text
Abstract:
Subgraph and supergraph search methods are promising techniques for the development of new drugs. For example, the chemical structure of favipiravir—an antiviral treatment for influenza—resembles the structure of some components of RNA. Represented as graphs, such compounds are similar to a subgraph of favipiravir. However, the existing supergraph search methods can only discover compounds that match exactly. We propose a novel problem, called similar supergraph search, and design an efficient algorithm to solve it. The problem is to identify all graphs in a database that are similar to any su
APA, Harvard, Vancouver, ISO, and other styles
6

da Silva, Murilo V. G., and André L. P. Guedes. "Perfect subgraph/supergraph." Electronic Notes in Discrete Mathematics 19 (June 2005): 411–16. http://dx.doi.org/10.1016/j.endm.2005.05.001.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Koch, Sebastian. "About Supergraphs. Part II." Formalized Mathematics 26, no. 2 (2018): 125–40. http://dx.doi.org/10.2478/forma-2018-0010.

Full text
Abstract:
Summary In the previous article [5] supergraphs and several specializations to formalize the process of drawing graphs were introduced. In this paper another such operation is formalized in Mizar [1], [2]: drawing a vertex and then immediately drawing edges connecting this vertex with a subset of the other vertices of the graph. In case the new vertex is joined with all vertices of a given graph G, this is known as the join of G and the trivial loopless graph K1. While the join of two graphs is known and found in standard literature (like [9], [4], [8] and [3]), the operation discribed in this
APA, Harvard, Vancouver, ISO, and other styles
8

Koch, Sebastian. "About Supergraphs. Part III." Formalized Mathematics 27, no. 2 (2019): 153–79. http://dx.doi.org/10.2478/forma-2019-0016.

Full text
Abstract:
Summary The previous articles [5] and [6] introduced formalizations of the step-by-step operations we use to construct finite graphs by hand. That implicitly showed that any finite graph can be constructed from the trivial edgeless graph K1 by applying a finite sequence of these basic operations. In this article that claim is proven explicitly with Mizar[4].
APA, Harvard, Vancouver, ISO, and other styles
9

Morris, T. R. "One-loop covariant supergraphs." Physics Letters B 164, no. 4-6 (1985): 315–20. http://dx.doi.org/10.1016/0370-2693(85)90333-8.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Galperin, A., E. Ivanov, V. Ogievetsky, and E. Sokatchev. "Harmonic supergraphs: Green functions." Classical and Quantum Gravity 2, no. 5 (1985): 601–16. http://dx.doi.org/10.1088/0264-9381/2/5/004.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Dissertations / Theses on the topic "Supergraphe"

1

Labarre, Anthony. "Combinatorial aspects of genome rearrangements and haplotype networks." Phd thesis, Universite Libre de Bruxelles, 2008. http://tel.archives-ouvertes.fr/tel-00482196.

Full text
Abstract:
La thèse couvre deux problèmes motivés par la biologie: l'étude des réarrangements génomiques, et celle des réseaux d'haplotypes. Les problèmes de réarrangements génomiques sont un cas particulier des problèmes de distances d'édition, où l'on cherche à transformer un objet en un autre en utilisant le plus petit nombre possible d'opérations, les opérations autorisées étant fixées au préalable; on s'intéresse également à la distance entre les deux objets, c'est-à-dire au calcul du nombre d'opérations dans une séquence optimale plutôt qu'à la recherche d'une telle séquence. Les problèmes de réarr
APA, Harvard, Vancouver, ISO, and other styles
2

Eggen, Loren G. "Approximating the chromatic number of an arbitrary graph using a supergraph heuristic." Thesis, Monterey, California. Naval Postgraduate School, 1997. http://hdl.handle.net/10945/7982.

Full text
Abstract:
Approved for public release; distribution is unlimited<br>We color the vertices of a graph G, so that no two adjacent vertices have the same color. We would like to do this as cheaply as possible. An efficient coloring would be very helpful in optimization models, with applications to bin packing, examination timetable construction, and resource allocations, among others. Graph coloring with the minimum number of colors is in general an NP-complete problem. However, there are several classes of graphs for which coloring is a polynomial-time problem. One such class is the chordal graphs. This t
APA, Harvard, Vancouver, ISO, and other styles
3

Grácio, Luciano Polónia Gonçalves. "From Supergraph Generation To Subgraph Counting." Master's thesis, 2019. https://hdl.handle.net/10216/126194.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Books on the topic "Supergraphe"

1

Eggen, Loren G. Approximating the chromatic number of an arbitrary graph using a supergraph heuristic. Naval Postgraduate School, 1997.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
2

United States. Congress. House. Committee on House Administration. Subcommittee on Libraries and Memorials. Underrepresentation of minorities in supergrade positions and above, at the Library of Congress. U.S. G.P.O., 1990.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
3

United States. Congress. House. Committee on House Administration. Subcommittee on Libraries and Memorials. Underrepresentation of minorities in supergrade positions and above, at the Library of Congress: Hearing held before the Subcommittee on Libraries and Memorials of the Committee on House Administration, U.S. House of Representatives, One Hundred First Congress, second session, April 26, 1990, Washington, DC. U.S. G.P.O., 1990.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
4

Approximating the Chromatic Number of an Arbitrary Graph Using a Supergraph Heuristic. Storming Media, 1997.

Find full text
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Supergraphe"

1

Grisaru, M. T. "Supergraphs." In Supersymmetry. Springer US, 1985. http://dx.doi.org/10.1007/978-1-4684-8398-7_7.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Lozano, Yolanda, Steven Duplij, Malte Henkel, et al. "Supergraph." In Concise Encyclopedia of Supersymmetry. Springer Netherlands, 2004. http://dx.doi.org/10.1007/1-4020-4522-0_571.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Zhu, Gaoping, Xuemin Lin, Wenjie Zhang, Wei Wang, and Haichuan Shang. "PrefIndex: An Efficient Supergraph Containment Search Technique." In Lecture Notes in Computer Science. Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-13818-8_26.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Bunke, Horst, P. Foggia, C. Guidobaldi, and M. Vento. "Graph Clustering Using the Weighted Minimum Common Supergraph." In Graph Based Representations in Pattern Recognition. Springer Berlin Heidelberg, 2003. http://dx.doi.org/10.1007/3-540-45028-9_21.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Daller, Évariste, Sébastien Bougleux, Luc Brun, and Olivier Lézoray. "Local Patterns and Supergraph for Chemical Graph Classification with Convolutional Networks." In Lecture Notes in Computer Science. Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-97785-0_10.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Ferrer, M., E. Valveny, and F. Serratosa. "Median Graph Computation by Means of a Genetic Approach Based on Minimum Common Supergraph and Maximum Common Subgraph." In Pattern Recognition and Image Analysis. Springer Berlin Heidelberg, 2009. http://dx.doi.org/10.1007/978-3-642-02172-5_45.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

"SUPERGRAPHS." In The Quantum Theory of Fields. Cambridge University Press, 2000. http://dx.doi.org/10.1017/cbo9781139644198.009.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

"Harmonic supergraphs." In Harmonic Superspace. Cambridge University Press, 2001. http://dx.doi.org/10.1017/cbo9780511535109.009.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

"FEYNMAN RULES FOR SUPERGRAPHS." In Supersymmetry and Supergravity. Princeton University Press, 2020. http://dx.doi.org/10.2307/j.ctvzxx9rz.14.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

"SUPERSPACE PERTURBATION THEORY AND SUPERGRAPHS." In Theory and Phenomenology of Sparticles. WORLD SCIENTIFIC, 2005. http://dx.doi.org/10.1142/9789812775351_0006.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Supergraphe"

1

Rodrigues Jr., Jose, Agma Traina, Christos Faloutsos, and Caetano Jr. "SuperGraph Visualization." In Eighth IEEE International Symposium on Multimedia (ISM'06). IEEE, 2006. http://dx.doi.org/10.1109/ism.2006.143.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Zhang, Wenjie, Xuemin Lin, Ying Zhang, Ke Zhu, and Gaoping Zhu. "Efficient probabilistic supergraph search." In 2016 IEEE 32nd International Conference on Data Engineering (ICDE). IEEE, 2016. http://dx.doi.org/10.1109/icde.2016.7498415.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Porpodas, Vasileios. "SuperGraph-SLP Auto-Vectorization." In 2017 26th International Conference on Parallel Architectures and Compilation Techniques (PACT). IEEE, 2017. http://dx.doi.org/10.1109/pact.2017.21.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Han, Lin, Richard C. Wilson, and Edwin R. Hancock. "A Supergraph-based Generative Model." In 2010 20th International Conference on Pattern Recognition (ICPR). IEEE, 2010. http://dx.doi.org/10.1109/icpr.2010.387.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Shang, Haichuan, Ke Zhu, Xuemin Lin, Ying Zhang, and Ryutaro Ichise. "Similarity search on supergraph containment." In 2010 IEEE 26th International Conference on Data Engineering (ICDE 2010). IEEE, 2010. http://dx.doi.org/10.1109/icde.2010.5447846.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Lyu, Bingqing, Lu Qin, Xuemin Lin, Lijun Chang, and Jeffrey Xu Yu. "Scalable supergraph search in large graph databases." In 2016 IEEE 32nd International Conference on Data Engineering (ICDE). IEEE, 2016. http://dx.doi.org/10.1109/icde.2016.7498237.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Wang, Jing, Nikos Ntarmos, and Peter Triantafillou. "Towards a subgraph/supergraph cached query-graph index." In 2015 IEEE International Conference on Big Data (Big Data). IEEE, 2015. http://dx.doi.org/10.1109/bigdata.2015.7364122.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Tong, Yongxin, Xiaofei Zhang, Caleb Chen Cao, and Lei Chen. "Efficient Probabilistic Supergraph Search Over Large Uncertain Graphs." In CIKM '14: 2014 ACM Conference on Information and Knowledge Management. ACM, 2014. http://dx.doi.org/10.1145/2661829.2661872.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Sakr, Sherif, and Ghazi Al-Naymat. "An efficient features-based processing technique for supergraph queries." In the Fourteenth International Database Engineering & Applications Symposium. ACM Press, 2010. http://dx.doi.org/10.1145/1866480.1866488.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Zhang, Shuo, Jianzhong Li, Hong Gao, and Zhaonian Zou. "A novel approach for efficient supergraph query processing on graph databases." In the 12th International Conference. ACM Press, 2009. http://dx.doi.org/10.1145/1516360.1516385.

Full text
APA, Harvard, Vancouver, ISO, and other styles
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography