Остановите войну!
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 14 matches
- 2021
- Chunqiu Fang, Ervin Györi, Binlong Li, Jimeng Xiao:
The anti-Ramsey numbers of C3 and C4 in complete r-partite graphs. Discret. Math. 344(11): 112540 (2021) - Bingchen Qian, Chengfei Xie, Gennian Ge:
On the minimal degree condition of graphs implying equality of the largest Kr-free subgraphs and (r - 1)-partite subgraphs. Discret. Math. 344(8): 112453 (2021) - 2020
- R. Raj Priyadarshini, N. Sivakumar:
Relay Selection Approach in Underwater Acoustic WSNs Using Bi-Partite Graph. Wirel. Pers. Commun. 111(1): 643-660 (2020) - Sangeeta Sen, Mariana Curado Malta, Devashish Katoriya, Biswanath Dutta, Animesh Dutta:
Labeled k-partite Graph for Statement Annotation in the Web of Data. WI/IAT 2020: 63-71 - 2017
- Kaine Black, Monica Wachowicz, Alec Parise:
Using Bi-partite graphs to cluster complex networks. IEEE BigData 2017: 4810-4812 - 2016
- Rui Li, Wenjie Li, Bruhadeshwar Bezawada, Zheng Qin:
Topological ordering based iterative TCAM rule compression using bi-partite graphs. ICNP 2016: 1-2 - 2015
- Jing Guo, Xiangen Chen, Zhiwen Wang, Bing Yao:
Total vertex irregularity strength of certain equitable complete m-partite graphs. Ars Comb. 123: 407-418 (2015) - 2013
- Vivek S. Nittoor, Reiji Suda:
Enumeration Based Search Algorithm For Finding A Regular Bi-partite Graph Of Maximum Attainable Girth For Specified Degree And Number Of Vertices. CoRR abs/1302.5754 (2013) - Vivek S. Nittoor, Reiji Suda:
Analysis Of The Girth For Regular Bi-partite Graphs With Degree 3. CoRR abs/1302.5755 (2013) - 2012
- Xiang Niu, Lusong Li, Tao Mei, Jialie Shen, Ke Xu:
Predicting Image Popularity in an Incomplete Social Media Community by a Weighted Bi-partite Graph. ICME 2012: 735-740 - 2009
- Kamanashis Biswas, S. A. M. Harun:
Constraint Minimum Vertex Cover in K Partite Graph, Approximation Algorithm and Complexity Analysis. CoRR abs/0909.0097 (2009) - 2007
- Jasmina Omic, Robert E. Kooij, Piet Van Mieghem:
Virus spread in complete bi-partite graphs. BIONETICS 2007: 49-56 - 2002
- Elizabeth J. Billington, Dean G. Hoffman:
Trade spectra of complete partite graphs. Discret. Math. 250(1-3): 23-39 (2002) - 1992
- Bruce M. Landman, Ezra A. Brown, Frederick J. Portier:
Partitions of bi-partite numbers into at mostj parts. Graphs Comb. 8(1): 65-73 (1992)
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-04-23 12:51 CEST 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