Остановите войну!
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 29 matches
- 2024
- Farzane Amirzade, Mohammad-Reza Sadeghi, Daniel Panario:
Construction of Protograph-Based LDPC Codes With Chordless Short Cycles. IEEE Trans. Inf. Theory 70(1): 51-74 (2024) - 2022
- Elaine M. Eschen, R. Sritharan:
Bipartite completion of colored graphs avoiding chordless cycles of given lengths. Discret. Appl. Math. 318: 97-112 (2022) - Dilson Lucas Pereira, Abilio Lucena, Alexandre Salles da Cunha, Luidi Simonetti:
Exact Solution Algorithms for the Chordless Cycle Problem. INFORMS J. Comput. 34(4): 1970-1986 (2022) - Farzane Amirzade, Mohammad-Reza Sadeghi, Daniel Panario:
Protograph-based LDPC codes with chordless short cycles and large minimum distance. CWIT 2022: 16-20 - 2020
- Eun Jung Kim, O-joung Kwon:
Erdős-Pósa property of chordless cycles and its applications. J. Comb. Theory, Ser. B 145: 65-112 (2020) - Dániel Marx:
Chordless Cycle Packing Is Fixed-Parameter Tractable. ESA 2020: 71:1-71:19 - Farzane Amirzade, Mohammad-Reza Sadeghi, Daniel Panario:
Construction of protograph-based LDPC codes with chordless short cycles. CoRR abs/2008.01322 (2020) - 2019
- Arthur H. Busch, R. Sritharan:
Some completion problems for graphs without chordless cycles of prescribed lengths. Discret. Appl. Math. 268: 21-34 (2019) - Daniel Weißauer:
In absence of long chordless cycles, large tree-width becomes a local phenomenon. J. Comb. Theory, Ser. B 139: 342-352 (2019) - 2018
- Eun Jung Kim, O-joung Kwon:
Erdős-Pósa property of chordless cycles and its applications. SODA 2018: 1665-1684 - 2017
- John L. Pfaltz:
A Role for Chordless Cycles in the Representation and Retrieval of Information. EDBT/ICDT Workshops 2017 - Eun Jung Kim, O-joung Kwon:
Erdős-Pósa property of chordless cycles and its applications. CoRR abs/1711.00667 (2017) - 2016
- Fabrizio Marinelli, Angelo Parente:
A heuristic based on negative chordless cycles for the maximum balanced induced subgraph problem. Comput. Oper. Res. 69: 68-78 (2016) - 2015
- Elisângela Silva Dias, Diane Castonguay:
Polynomial enumeration of chordless cycles on cyclically orientable graphs. CoRR abs/1505.02829 (2015) - 2014
- Takeaki Uno, Hiroko Satoh:
An Efficient Algorithm for Enumerating Chordless Cycles and Chordless Paths. Discovery Science 2014: 313-324 - Rui A. Ferreira, Roberto Grossi, Romeo Rizzi, Gustavo Sacomoto, Marie-France Sagot:
Amortized Õ(|V|) -Delay Algorithm for Listing Chordless Cycles in Undirected Graphs. ESA 2014: 418-429 - Elisângela Silva Dias, Diane Castonguay, Humberto J. Longo, Walid Abdala Rfaei Jradi, Hugo A. D. do Nascimento:
Fast Parallel Algorithm for Enumerating All Chordless Cycles in Graphs. CoRR abs/1410.4876 (2014) - Rui A. Ferreira, Roberto Grossi, Romeo Rizzi, Gustavo Sacomoto, Marie-France Sagot:
Amortized Õ(|V|)-Delay Algorithm for Listing Chordless Cycles in Undirected Graphs. CoRR abs/1408.1265 (2014) - Takeaki Uno, Hiroko Satoh:
An Efficient Algorithm for Enumerating Chordless Cycles and Chordless Paths. CoRR abs/1404.7610 (2014) - 2013
- Terry A. McKee:
A note on sparseness conditions on chordless vertices of cycles. Discret. Math. 313(11): 1221-1223 (2013) - John L. Pfaltz:
Chordless cycles in networks. ICDE Workshops 2013: 223-228 - Elisângela Silva Dias, Diane Castonguay, Humberto J. Longo, Walid Abdala Rfaei Jradi:
Efficient Enumeration of All Chordless Cycles in Graphs. CoRR abs/1309.1051 (2013) - 2012
- Nayla Sokhn, Richard Baltensperger, Louis-Félix Bersier, Jean Hennebert, Ulrich Ultes-Nitsche:
Identification of Chordless Cycles in Ecological Networks. Complex 2012: 316-324 - 2008
- Marcel Wild:
Generating all cycles, chordless cycles, and Hamiltonian cycles with the principle of exclusion. J. Discrete Algorithms 6(1): 93-102 (2008) - 2005
- Cyriel Van Nuffelen, Kristel Van Rompay:
On the length of longest chordless cycles. 4OR 3(2): 133-138 (2005) - 2002
- Vasek Chvátal, Irena Rusu, R. Sritharan:
Dirac-type characterizations of graphs without long chordless cycles. Discret. Math. 256(1-2): 445-448 (2002) - 1999
- Irena Rusu:
Berge graphs with chordless cycles of bounded length. J. Graph Theory 32(1): 73-79 (1999) - 1996
- Uri N. Peled, Julin Wu:
or Which Graphs Does Every Edge Belong to Exactly Two Chordless Cycles? Electron. J. Comb. 3(1) (1996) - 1993
- N. Chandrasekharan, Laks V. S. Lakshmanan, Muralidhar Medidi:
Efficient Parallel Algorithms for Finding Chordless Cycles in Graphs. Parallel Process. Lett. 3: 165-170 (1993)
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-05-11 09:35 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