-
Graphs without a partition into two proportionally dense subgraphsBazgan, Cristina ; Chlebíková, Janka ; Dallard, ClémentSource: Information processing letters. - ISSN 0020-0190 (Vol. 155, 2020, str. 1-5)Type of material - article, component part ; adult, seriousPublish date - 2020Language - englishCOBISS.SI-ID - 1541789380
Author
Bazgan, Cristina |
Chlebíková, Janka |
Dallard, Clément
Topics
particija grafa |
gost podgraf |
kombinatorični problem |
kombinatorični problem |
graph partition |
dense subgraph |
combinatorial problem |
combinatorial problem |
weighted efficient domination |
bounded degree vertices |
k-Bounded Weighted Efficient Domination |
polynomial-time algorithm |
graph algorithms |
graph algorithms
![loading ... loading ...](themes/default/img/ajax-loading.gif)
Shelf entry
Permalink
- URL:
Impact factor
Access to the JCR database is permitted only to users from Slovenia. Your current IP address is not on the list of IP addresses with access permission, and authentication with the relevant AAI accout is required.
Year | Impact factor | Edition | Category | Classification | ||||
---|---|---|---|---|---|---|---|---|
JCR | SNIP | JCR | SNIP | JCR | SNIP | JCR | SNIP |
Select the library membership card:
DRS, in which the journal is indexed
Database name | Field | Year |
---|
Links to authors' personal bibliographies | Links to information on researchers in the SICRIS system |
---|---|
Bazgan, Cristina | ![]() |
Chlebíková, Janka | ![]() |
Dallard, Clément | 53750 |
Select pickup location:
Material pickup by post
Notification
Subject headings in COBISS General List of Subject Headings
Select pickup location
Pickup location | Material status | Reservation |
---|
Please wait a moment.