Остановите войну!
for scientists:
default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 25 matches
- 2023
- Stéphane Bessy, Johannes Pardey, Lucas Picasarri-Arrieta, Dieter Rautenbach:
Unbalanced Spanning Subgraphs in Edge Labeled Complete Graphs. Electron. J. Comb. 30(1) (2023) - Jiayi Wang, Lina Yang, Xichun Li, Patrick Shen-Pei Wang, Zuqiang Meng:
Edge-Labeled and Node-Aggregated Graph Neural Networks for Few-Shot Relation Classification. Int. J. Pattern Recognit. Artif. Intell. 37(5): 2350010:1-2350010:22 (2023) - Daniel Severo, James Townsend, Ashish Khisti, Alireza Makhzani:
Random Edge Coding: One-Shot Bits-Back Coding of Large Labeled Graphs. CoRR abs/2305.09705 (2023) - 2022
- Mark Korenblit, Vadim E. Levit:
On lengths of edge-labeled graph expressions. Discret. Appl. Math. 319: 583-594 (2022) - Kento Miura, Ryohei Kobayashi, Toshiyuki Amagasa, Hiroyuki Kitagawa, Norihisa Fujita, Taisuke Boku:
An FPGA-based Accelerator for Regular Path Queries over Edge-labeled Graphs. IEEE Big Data 2022: 415-422 - Yanping Wu, Renjie Sun, Chen Chen, Xiaoyang Wang, Xianming Fu:
Efficiently Answering Minimum Reachable Label Set Queries in Edge-Labeled Graphs. CIKM 2022: 4585-4589 - Iiro Kumpulainen, Nikolaj Tatti:
Community Detection in Edge-Labeled Graphs. DS 2022: 460-475 - Iiro Kumpulainen, Nikolaj Tatti:
Community detection in edge-labeled graphs. CoRR abs/2210.10583 (2022) - 2021
- Marc Hellmuth, Carsten R. Seemann, Peter F. Stadler:
Generalized Fitch Graphs III: Symmetrized Fitch maps and Sets of Symmetric Binary Relations that are explained by Unrooted Edge-labeled Trees. Discret. Math. Theor. Comput. Sci. 23(1) (2021) - Jinhong Jung, Woojeong Jin, Ha-Myung Park, U Kang:
Accurate relational reasoning in edge-labeled graphs by multi-labeled random walk with restart. World Wide Web 24(4): 1369-1393 (2021) - 2020
- Marc Hellmuth, Carsten R. Seemann, Peter F. Stadler:
Generalized Fitch graphs II: Sets of binary relations that are explained by edge-labeled trees. Discret. Appl. Math. 283: 495-511 (2020) - Marc Hellmuth, Carsten R. Seemann, Peter F. Stadler:
Generalized Fitch Graphs III: Symmetrized Fitch maps and Sets of Symmetric Binary Relations that are explained by Unrooted Edge-labeled Trees. CoRR abs/2001.05921 (2020) - 2019
- Marc Hellmuth:
Generalized Fitch graphs: Edge-labeled graphs that are explained by edge-labeled trees. Discret. Appl. Math. 267: 1-11 (2019) - 2018
- Francesco Parisi, Noseong Park, Andrea Pugliese, V. S. Subrahmanian:
Top-k User-Defined Vertex Scoring Queries in Edge-Labeled Graph Databases. ACM Trans. Web 12(4): 21:1-21:35 (2018) - Jenni Reuben:
Towards a Differential Privacy Theory for Edge-Labeled Directed Graphs. Sicherheit 2018: 273-278 - Marc Hellmuth:
Generalized Fitch Graphs: Edge-labeled Graphs that are explained by Edge-labeled Trees. CoRR abs/1802.03657 (2018) - 2017
- Miguel Araujo:
Communities and Anomaly Detection in Large Edged-Labeled Graphs. University of Porto, Portugal, 2017 - Tahsin Reza, Christine Klymko, Matei Ripeanu, Geoffrey Sanders, Roger A. Pearce:
Towards Practical and Robust Labeled Pattern Matching in Trillion-Edge Graphs. CLUSTER 2017: 1-12 - 2016
- Noseong Park:
Top-K Query Processing in Edge-Labeled Graph Data. University of Maryland, College Park, MD, USA, 2016 - 2014
- Francesco Bonchi, Aristides Gionis, Francesco Gullo, Antti Ukkonen:
Distance oracles in edge-labeled graphs. EDBT 2014: 547-558 - 2013
- He Li, Mengxiang Lin, Tahir Jameel, Zhenyuan Jiang:
Locating and Understanding Concurrency Bugs Based on Edge-labeled Communication Graphs (S). SEKE 2013: 525-530 - Brigitte Boden, Stephan Günnemann, Holger Hoffmann, Thomas Seidl:
RMiCS: a robust approach for mining coherent subgraphs in edge-labeled multi-layer graphs. SSDBM 2013: 23:1-23:12 - 1990
- Edward A. Bender, E. Rodney Canfield, Brendan D. McKay:
The Asymptotic Number of Labeled Connected Graphs with a Given Number of Vertices and Edges. Random Struct. Algorithms 1(2): 127-170 (1990) - 1986
- Edward A. Bender, L. Bruce Richmond:
Asymptotic enumeration of labeled multigraphs by vertices, edges, and degree parities. J. Graph Theory 10(1): 41-46 (1986) - 1975
- Lyle G. Hartman:
Edge-labeled directed graphs in APL. APL 1975: 181-187
loading more results
failed to load more results, please try again later
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
retrieved on 2024-03-28 16:32 CET from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint