|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 5 occurrences of 3 keywords
|
|
|
|
|
Results
Found 6 publication records. Showing 6 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Nicole Eggemann, Steven D. Noble |
The complexity of two graph orientation problems.  |
Discrete Applied Mathematics  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Nicole Eggemann, Steven D. Noble |
The clustering coefficient of a scale-free random graph. |
Discrete Applied Mathematics |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Nicole Eggemann, Frédéric Havet, Steven D. Noble |
k-L(2, 1)-labelling for planar graphs is NP-complete for k>=4. |
Discrete Applied Mathematics |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Nicole Eggemann, Steven D. Noble |
Minimizing the Oriented Diameter of a Planar Graph. |
Electronic Notes in Discrete Mathematics |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Philippe Duchon, Nicole Eggemann, Nicolas Hanusse |
Non-Searchability of Random Power-Law Graphs. |
OPODIS |
2007 |
DBLP DOI BibTeX RDF |
Routing, Distributed Algorithm, Random graphs |
| 1 | Philippe Duchon, Nicole Eggemann, Nicolas Hanusse |
Non-searchability of random scale-free graphs. |
PODC |
2007 |
DBLP DOI BibTeX RDF |
scale-free graph, routing, distributed algorithms |
Displaying result #1 - #6 of 6 (100 per page; Change: )
|
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")